Navigation
API > API/Runtime > API/Runtime/Engine > API/Runtime/Engine/FTreeParser
Overloads
| Name | Remarks | Include Path | Unreal Specifiers |
|---|---|---|---|
static EParseAction ParseDirectedAcyclic
(
TProfile::TNodeType InRootNode, |
TreeParser.h | ||
static EParseAction ParseDirectedAcyclic
(
TNodeType InRootNode, |
Parses a list of nodes and edges from a a Directed Acyclic Graph (DAG). | TreeParser.h |
ParseDirectedAcyclic(TProfile::TNodeType, TProfile &, TEnterFunc, TExitFunc)
| Name | ParseDirectedAcyclic |
| Type | function |
| Header File | /Engine/Source/Runtime/Engine/Public/TreeParser.h |
| Include Path | #include "TreeParser.h" |
template<typename TProfile, class TEnterFunc, class TExitFunc>
static EParseAction ParseDirectedAcyclic
(
TProfile::TNodeType InRootNode,
TProfile & InProfile,
TEnterFunc EnterFunc,
TExitFunc ExitFunc
)
ParseDirectedAcyclic(TNodeType, TGetNumChildren, TGetChild, TEnterFunc, TExitFunc)
Description
Parses a list of nodes and edges from a a Directed Acyclic Graph (DAG). This function is designed for a more general graph structure where a node can have multiple parents, which is common for modeling dependencies, etc. A valid DAG tree must satisfy three conditions:
Edges are directed.
It contains no cycles.
A node can have any number of incoming edges (0, 1, or more). Already visited nodes will be skipped.
| Name | ParseDirectedAcyclic |
| Type | function |
| Header File | /Engine/Source/Runtime/Engine/Public/TreeParser.h |
| Include Path | #include "TreeParser.h" |
template<typename TNodeType, class TGetNumChildren, class TGetChild, class TEnterFunc, class TExitFunc>
static EParseAction ParseDirectedAcyclic
(
TNodeType InRootNode,
TGetNumChildren GetNumChildren,
TGetChild GetChild,
TEnterFunc EnterFunc,
TExitFunc ExitFunc
)