1. Epic GamesDeveloper
  3. FDirectedGraphAlgo

FDirectedGraphAlgo

API > API/Plugins > API/Plugins/MetasoundGraphCore

   
Name FDirectedGraphAlgo
Type struct
Header File /Engine/Plugins/Runtime/Metasound/Source/MetasoundGraphCore/Public/MetasoundGraphAlgo.h
Include Path #include "MetasoundGraphAlgo.h"

Syntax

struct FDirectedGraphAlgo

Functions

Static

Name Remarks Include Path Unreal Specifiers

static TPimplPtr< FDirectedGraphAlgoAdapter > CreateDirectedGraphAlgoAdapter ( const IGraph& InGraph
)

 The FDirectedGraphAlgoAdapter caches internal representations of the passed in IGraph. MetasoundGraphAlgo.h  

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. MetasoundGraphAlgo.h  

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. MetasoundGraphAlgo.h  

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. MetasoundGraphAlgo.h  

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. MetasoundGraphAlgo.h  

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. MetasoundGraphAlgo.h  

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. MetasoundGraphAlgo.h  

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. MetasoundGraphAlgo.h  

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. MetasoundGraphAlgo.h  

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

 Sort the nodes of a directed acyclic graph using Kahn's topological sorting algorithm. MetasoundGraphAlgo.h  

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

 Sort the nodes of a directed acyclic graph using Kahn's topological sorting algorithm. MetasoundGraphAlgo.h  

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

 Find strongly connected components given a MetasoundIGraph. MetasoundGraphAlgo.h  

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

 Find strongly connected components given a MetasoundIGraph. MetasoundGraphAlgo.h  

Ask questions and help your peers Developer Forums

Write your own tutorials or read those from others Learning Library

On this page