PersistentGraph

Graph implemented using persistent collections.

Should be somewhat efficient if making extensive use of time-travel debugging, otherwise MutableGraph should be a better option.

Constructors

constructor()

open override fun addBehavior(behavior: ExternalBehavior)

open override fun addChild(behavior: BehaviorID, child: NodeID)

open override fun addChild(parent: NodeID, child: NodeID)

Adds a parent-child edge to the graph.

open override fun addNode(node: Node<*>)

Adds a node to the graph.

Get the list of all child nodes of a node in the graph.

Get the current list of the child map in the graph.

Get the current map of nodes in the graph.

Get the list of current nodes in the graph.

open override fun getNode(id: NodeID): Node<*>?

Get the node (if any) corresponding to the given id.

Reset the state of the child map to match that of the passed map.