cnuernber.depsviz.graph — cnuernber/depsviz 0.10

add-edge clj

(add-edge graph parent-id child-id)

add-node clj

(add-node graph node)

Add a node to the graph with a list of predecessors. If the node has no id one will be generated; if it does and it is not unique and exception will be thrown. If any of the predecessors does not exist an error will be thrown. Returns a pair of [graph node-id]

child->parent-map clj

(child->parent-map graph)

child-seq clj

(child-seq graph)

child-set clj

(child-set graph)

dfs-seq clj

(dfs-seq graph)

Get a sequence of ids in dfs order.

edges clj

(edges graph)

edges->map clj

(edges->map graph key-fn val-fn)

empty-graph clj

(empty-graph)

Create an empty graph, which is stored as a map of: {:edges [] adjacency list of [id id] :id->node-map {} each node has an id and a type }

find-nodes clj

(find-nodes graph node-name)

Find nodes that match or partially match string. Return sequence of node-ids

get-node clj

(get-node graph node-id)

keep-only clj

(keep-only graph node-id-seq)

leaves clj

(leaves graph)

merge-nodes-by clj

(merge-nodes-by graph key-fn filter-fn)

node-exists? clj

(node-exists? graph node-id)

parent->child-map clj

(parent->child-map graph)

parent-seq clj

(parent-seq graph)

parent-set clj

(parent-set graph)

path-to-root clj

(path-to-root child->parent-map target-id)

relative-dfs-seq clj

(relative-dfs-seq graph node-id)

remove-nodes clj

(remove-nodes graph node-id-seq)

roots clj

(roots graph)

set->ordered-vec clj

(set->ordered-vec item-set item-seq)

single-islands clj

(single-islands graph)

Things that have no connections at all. Can be interpreted as either root or leaf.