bool |
CanIgnoreNode ( const UEdGraphNode* Node ) |
Can this node be ignored for further processing? |
int32 |
CountIncomingEdges ( const UEdGraphNode* Node ) |
Counts the number of incoming edges this node has (along all input pins) |
void |
CreateExecutionSchedule ( const TArray< UEdGraphNode* > ..., TArray< UEdGraphNode* >& Line... ) |
Performs a topological sort on the graph of nodes passed in (which is expected to form a DAG), scheduling them. |
UEdGraphNode... |
FindNodeByClass ( const UEdGraph* Graph, TSubclassOf< UEdGraphNode > NodeCla..., bool bExpectedUnique ) |
Scans a graph for a node of the specified class. |
bool |
PinIsImportantForDependancies ( const UEdGraphPin* Pin ) |
Does this pin potentially participate in data dependencies? |
void |
PruneIsolatedNodes ( const TArray< UEdGraphNode* > ..., TArray< UEdGraphNode* >& Grap... ) |
Prunes any nodes that weren't visited from the graph, printing out a warning |
bool |
ShouldForceKeepNode ( const UEdGraphNode* Node ) |
Should this node be kept even if it's not reached? |
bool |
ValidateGraphIsWellFormed ( UEdGraph* Graph ) |
Performs standard validation on the graph (outputs point to inputs, no more than one connection to each input, types match on both ends, etc...) |
void |
ValidateLink ( const UEdGraphPin* PinA, const UEdGraphPin* PinB ) |
Validates that the interconnection between two pins is schema compatible |
void |
ValidateNode ( const UEdGraphNode* Node ) |
Validates that the node is schema compatible |
void |
ValidatePin ( const UEdGraphPin* Pin ) |
Validate that the wiring for a single pin is schema compatible |