Documentation / scene / BlueprintDAG

Interface: BlueprintDAG

Defined in: libs/scene/src/utility/blueprint/node.ts:94

Complete representation of a Blueprint Directed Acyclic Graph (DAG)

Remarks

Contains all structural information of the node graph:

• Node mapping table
• Root nodes list (nodes with no inputs)
• Graph structure (adjacency lists)
• Topological sort order (for executing nodes in dependency order)

Example

const dag: BlueprintDAG = {
  nodeMap: { 1: node1, 2: node2, 3: node3 },
  roots: [1],  // node1 is a root node
  graph: { outgoing: {...}, incoming: {...} },
  order: [1, 2, 3]  // Topological sort result
};

Properties

nodeMap

nodeMap: Record<number, IGraphNode>

Defined in: libs/scene/src/utility/blueprint/node.ts:96

Mapping from node ID to node instance

---

roots

roots: number[]

Defined in: libs/scene/src/utility/blueprint/node.ts:101

List of root node IDs

Remarks

Root nodes are nodes with no input connections, typically constants or parameter nodes

---

graph

graph: GraphStructure

Defined in: libs/scene/src/utility/blueprint/node.ts:103

The adjacency list structure of the graph

---

order

order: number[]

Defined in: libs/scene/src/utility/blueprint/node.ts:108

Topological sort order of nodes

Remarks

List of node IDs sorted by dependency relationships, used for correct execution order