skainet-compile-dag/sk.ainet.lang.graph/SimpleComputeGraph

SimpleComputeGraph

class SimpleComputeGraph(nodesInit: List<GraphNode> = emptyList(), edgesInit: List<GraphEdge> = emptyList()) : ComputeGraph(source)

Minimal production ComputeGraph implementation for tape-based recording path. This mirrors the behavior of the test DefaultComputeGraph but is simplified.

Constructors

SimpleComputeGraph

constructor(nodesInit: List<GraphNode> = emptyList(), edgesInit: List<GraphEdge> = emptyList())

Properties

edges

open override val edges: List<GraphEdge>

All edges in the graph

nodes

open override val nodes: List<GraphNode>

All nodes in the graph

Functions

addEdge

open override fun addEdge(edge: GraphEdge): GraphEdge

Adds a new edge connecting two nodes

addNode

open override fun addNode(node: GraphNode): GraphNode

Adds a new node to the graph

clear

open override fun clear()

Clears all nodes and edges

copy

open override fun copy(): ComputeGraph

Creates a copy of this graph

getInputNodes

open override fun getInputNodes(): List<GraphNode>

Gets all input nodes (nodes with no incoming edges)

open override fun getInputNodes(node: GraphNode): List<GraphNode>

Gets nodes that are inputs to the given node

getOutputNodes

open override fun getOutputNodes(): List<GraphNode>

Gets all output nodes (nodes with no outgoing edges)

open override fun getOutputNodes(node: GraphNode): List<GraphNode>

Gets nodes that receive output from the given node

getTopologicalOrder

open override fun getTopologicalOrder(): List<GraphNode>

Returns nodes in topological order for execution

removeEdge

open override fun removeEdge(edge: GraphEdge): Boolean

Removes an edge from the graph

removeNode

open override fun removeNode(node: GraphNode): Boolean

Removes a node and all connected edges from the graph

validate

open override fun validate(): ValidationResult

Validates the graph structure (checks for cycles, etc.)