extra-loom.multigraph — extra-loom 0.1.5

build-graph clj/s

(build-graph g & inits)

Builds up a graph (i.e. adds edges and nodes) from any combination of adjacency maps, edges, or nodes.

digraph? clj/s

(digraph? g)

distinct-edges clj/s

(distinct-edges g)

The distinct edges in the graph. eliminates mirrored edges.

edge-equiv? clj/s

(edge-equiv? this other)

Does this edge have the same src and dest as the other?

edge? clj/s

(edge? e)

Is e an edge?

edges-between* clj/s

(edges-between* g n1 n2)

Identified clj/s protocol

id clj/s

(id this)

Returns the id of this.

mirrored? clj/s

(mirrored? this)

Returns true if this is a mirrored edge.

impl-multipleedge clj

make-edge clj/s

(make-edge src dest)

(make-edge src dest mirrored?)

Returns a new UniqueEdge instance from src and dest.

merge-graphs clj/s

(merge-graphs & gs)

Merges multigraphs or multidigraphs.

multidigraph clj/s

(multidigraph & inits)

MultiEdgeEditableDigraph clj/s

MultiEdgeEditableGraph clj/s

multigraph clj/s

(multigraph & inits)

MultipleEdge clj/s protocol

edges-between clj/s

(edges-between g n1 n2)

Returns the edges in g between two nodes.

pprint clj/s

(pprint g)

Pretty print a multidigraph

unique-edge? clj/s

(unique-edge? e)

Is e a UniqueEdge?

UniqueEdge clj/s