stately.graph.directed-graph — stately 0.1.2-SNAPSHOT

edges clj

(edges [k v])

Make graph out edges out of successors of node. Currently, I am thinking through how to avoid having to explicitly define the successors of the nodes.

Graph clj protocol

graph clj

(graph this)

the graph abstraction underlying the state machine

nodes clj

(nodes this)

the nodes associated with this state machine

make-graph clj

(make-graph node-map)

build a map of the loom graph representation and the node definitions to carry node meta-data. Use the loom digraph API to enforce FSM invariants e.g. every node has a path to an accept state.

new-graph clj

(new-graph g nodes)

StatelyGraph clj