telar-core/dev.deeptelar.telar/GraphTopology

GraphTopology

data class GraphTopology(val nodes: List<String>, val edges: List<GraphEdge>, val dynamicRoutes: Set<String>, val subgraphs: Map<String, GraphTopology> = emptyMap())

The structure of a compiled graph: its nodes and the edges between them. Read it from CompiledGraph.topology to draw the graph or to check it in a test.

Constructors

GraphTopology

constructor(nodes: List<String>, edges: List<GraphEdge>, dynamicRoutes: Set<String>, subgraphs: Map<String, GraphTopology> = emptyMap())

Properties

dynamicRoutes

val dynamicRoutes: Set<String>

the nodes whose conditional edge declares no targets. Such a node can route to any node or to END, so it has no entries in edges.

edges

val edges: List<GraphEdge>

every edge that is known before the graph runs: the static edges, the declared targets of conditional edges, and an edge to END for each node that has no outgoing edge.

nodes

val nodes: List<String>

the node names in the order they were added, without START and END.

subgraphs

val subgraphs: Map<String, GraphTopology>

the structure of the graph that a node added with StateGraph.subgraph runs, by the name of that node. The node is in nodes and edges like any other.

Functions

successors

fun successors(node: String): List<String>

The nodes (or END) that node can lead to according to edges.