1. Epic GamesDeveloper
  3. FDirectedGraphAlgo

FDirectedGraphAlgo

API > API/Runtime > API/Runtime/SignalProcessing > API/Runtime/SignalProcessing/DSP

References

   
Module SignalProcessing
Header /Engine/Source/Runtime/SignalProcessing/Public/DSP/DirectedGraphAlgo.h
Include #include "DSP/DirectedGraphAlgo.h"

Syntax

struct FDirectedGraphAlgo

Functions

  Type Name Description
Public function Static void

BreadthFirstTraversal ( int32 InInitialVertex,
const FDirectedTree& InTree,
TFunctionRef< bool(int32)> InVisitFunc
)

 Traverse a tree in a breadth first ordering.
Public function Static void

BuildDirectedTree ( TArrayView< const FDirectedEdge > InEdges,
FDirectedTree& OutTree
)

 Build a directed tree from an array of edges.InEdges - An array of directed eges.
Public function Static void Build a transpose directed tree from an array of edges.
Public function Static bool

DepthFirstTopologicalSort ( TArrayView< const int32 > InUniqueVertices,
TArrayView< const FDirectedEdge > InUniqueEdges,
TArray< int32 >& OutVertexOrder
)

 Sort vertices topologically using a depth first sorting algorithm.
Public function Static void

DepthFirstTraversal ( int32 InInitialVertex,
const FDirectedTree& InTree,
TFunctionRef< bool(int32)> InVisitFunc
)

 Traverse a tree in a depth first ordering.
Public function Static bool

KahnTopologicalSort ( TArrayView< const int32 > InUniqueVertices,
TArrayView< const FDirectedEdge > InUniqueEdges,
TArray< int32 >& OutVertexOrder
)

 Sort vertices topologically using a Kahn's sorting algorithm.
Public function Static bool

TarjanStronglyConnectedComponents ( const TSet< FDirectedEdge >& InEdges,
TArray< FStronglyConnectedComponent >& OutComponents,
bool bExcludeSingleVertex
)

 Find strongly connected components given a set of edges using Tarjan algorithm.

Ask questions and help your peers Developer Forums

Write your own tutorials or read those from others Learning Library

On this page