Navigation
API > API/Runtime > API/Runtime/SignalProcessing > API/Runtime/SignalProcessing/DSP > API/Runtime/SignalProcessing/DSP/FDirectedGraphAlgo
References
| Module | SignalProcessing |
| Header | /Engine/Source/Runtime/SignalProcessing/Public/DSP/DirectedGraphAlgo.h |
| Include | #include "DSP/DirectedGraphAlgo.h" |
| Source | /Engine/Source/Runtime/SignalProcessing/Private/DirectedGraphAlgo.cpp |
static bool TarjanStronglyConnectedComponents
&40;
const TSet< FDirectedEdge > & InEdges,
TArray< FStronglyConnectedComponent > & OutComponents,
bool bExcludeSingleVertex
&41;
Remarks
Find strongly connected components given a set of edges using Tarjan algorithm. True if one or more strongly connected components are added to OutComponents. False otherwise.
Parameters
| Name | Description |
|---|---|
| InEdges | Edges in the directed graph. |
| OutComponents | Strongly connected components found in the graph are be added to this array. |
| bExcludeSingleVertex | If true, single vertices are not be returned as strongly connected components. If false, single vertices may be returned as strongly connected components. |