Navigation
API > API/Plugins > API/Plugins/CommonConversationGraph > API/Plugins/CommonConversationGraph/FConversationCompiler
Description
Functions similarly to ForeachConnectedOutgoingConversationNode but visits nodes based on their left to right order
Knots are visited in depth-first order such that a graph like the following results in the order A B C D * /|\ / | \ * C D / \ / \ / \ / \ A B
| Name | ForeachConnectedOutgoingConversationNodeSorted |
| Type | function |
| Header File | /Engine/Plugins/Experimental/CommonConversation/Source/CommonConversationGraph/Public/ConversationCompiler.h |
| Include Path | #include "ConversationCompiler.h" |
| Source | /Engine/Plugins/Experimental/CommonConversation/Source/CommonConversationGraph/Private/ConversationCompiler.cpp |
static void ForeachConnectedOutgoingConversationNodeSorted
(
UEdGraphPin * Pin,
TFunctionRef < void *)> Predicate
)