1. Epic GamesDeveloper
  3. FDirectedGraphAlgo

FDirectedGraphAlgo

API > API/Plugins > API/Plugins/MetasoundGraphCore

Deprecated * Use the equivalent type declared in `namespace DirectedGrpahAlgo {...}_

References

   
Module MetasoundGraphCore
Header /Engine/Plugins/Runtime/Metasound/Source/MetasoundGraphCore/Public/MetasoundGraphAlgo.h
Include #include "MetasoundGraphAlgo.h"

Syntax

struct FDirectedGraphAlgo

Functions

  Type Name Description
Public function Static TPimplPtr< FDirectedGraphAlgoAdapter > The FDirectedGraphAlgoAdapter caches internal representations of the passed in IGraph.
Public function Static bool

DepthFirstTopologicalSort ( const IGraph& InGraph,
TArray< const INode* >& OutNodeOrder
)

 Sort the nodes of a directed acyclic graph using a depth-first topological sorting algorithm.
Public function Static bool

DepthFirstTopologicalSort ( const FDirectedGraphAlgoAdapter& InAdapter,
TArray< const INode* >& OutNodeOrder
)

 Sort the nodes of a directed acyclic graph using a depth-first topological sorting algorithm.
Public function Static void

FindReachableNodes ( const IGraph& InGraph,
TSet< const INode* >& OutNodes
)

 Finds all nodes which can be reached by traversing the graph beginning from FInputDataDestinations or by traversing the transpose graph beginning from FOutputDataSource nodes.
Public function Static void

FindReachableNodes ( const FDirectedGraphAlgoAdapter& InAdapter,
TSet< const INode* >& OutNodes
)

 Finds all nodes which can be reached by traversing the graph beginning from FInputDataDestinations or by traversing the transpose graph beginning from FOutputDataSource nodes.
Public function Static void

FindReachableNodesFromInput ( const IGraph& InGraph,
TSet< const INode* >& OutNodes
)

 Finds all nodes which can be reached by traversing the graph beginning from FInputDataDestination nodes.
Public function Static void

FindReachableNodesFromInput ( const FDirectedGraphAlgoAdapter& InAdapter,
TSet< const INode* >& OutNodes
)

 Finds all nodes which can be reached by traversing the graph beginning from FInputDataDestination nodes.
Public function Static void

FindReachableNodesFromOutput ( const IGraph& InGraph,
TSet< const INode* >& OutNodes
)

 Finds all nodes which can be reached by traversing the transpose graph beginning from FOutputDataSource nodes.
Public function Static void

FindReachableNodesFromOutput ( const FDirectedGraphAlgoAdapter& InAdapter,
TSet< const INode* >& OutNodes
)

 Finds all nodes which can be reached by traversing the transpose graph beginning from FOutputDataSource nodes.
Public function Static bool

KahnTopologicalSort ( const IGraph& InGraph,
TArray< const INode* >& OutNodeOrder
)

 Sort the nodes of a directed acyclic graph using Kahn's topological sorting algorithm.
Public function Static bool

KahnTopologicalSort ( const FDirectedGraphAlgoAdapter& InAdapter,
TArray< const INode* >& OutNodeOrder
)

 Sort the nodes of a directed acyclic graph using Kahn's topological sorting algorithm.
Public function Static bool

TarjanStronglyConnectedComponents ( const IGraph& InGraph,
TArray< DirectedGraphAlgo::FStronglyConnectedComponent >& OutComponents,
bool bExcludeSingleVertex
)

 Find strongly connected components given a MetasoundIGraph.
Public function Static bool

TarjanStronglyConnectedComponents ( const FDirectedGraphAlgoAdapter& InAdapter,
TArray< DirectedGraphAlgo::FStronglyConnectedComponent >& OutComponents,
bool bExcludeSingleVertex
)

 Find strongly connected components given a MetasoundIGraph.

Ask questions and help your peers Developer Forums

Write your own tutorials or read those from others Learning Library

On this page