loom.graph — aysylu/loom 1.0.2

Defines protocols for graphs, digraphs, and weighted graphs. Also provides record implementations and constructors for simple graphs -- weighted, unweighted, directed, and undirected. The implementations are based on adjacency lists.

*default-weight* clj/s

Weight used when none is given for edges in weighted graphs

add-cycle clj/s

(add-cycle g & nodes)

Adds a cycle of edges connecting the given nodes in order

add-edges clj/s

(add-edges g & edges)

Adds edges to graph g. For unweighted graphs, edges take the form [n1 n2]. For weighted graphs, edges take the form [n1 n2 weight] or [n1 n2], the latter defaulting to a weight of 1

add-nodes clj/s

(add-nodes g & nodes)

Adds nodes to graph g. Nodes can be any type of object

add-path clj/s

(add-path g & nodes)

Adds a path of edges connecting the given nodes in order

BasicEditableDigraph clj/s

BasicEditableGraph clj/s

BasicEditableWeightedDigraph clj/s

BasicEditableWeightedGraph clj/s

build-graph clj/s

(build-graph g & inits)

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

default-digraph-impl clj

default-graph-impls clj

default-weighted-graph-impl clj

Digraph clj/s protocol

in-degree clj/s

(in-degree g node)

Returns the number of direct predecessors to node

in-edges clj/s

(in-edges g node)

Returns all the incoming edges of node

predecessors* clj/s

(predecessors* g node)

Returns direct predecessors of node

transpose clj/s

(transpose g)

Returns a graph with all edges reversed

digraph clj/s

(digraph & inits)

Creates an unweighted, directed graph. inits can be edges, adjacency maps, or graphs

directed? clj/s

(directed? g)

Returns true if g satisfies the Digraph protocol

Edge clj/s protocol

dest clj/s

(dest edge)

Returns the dest node of the edge

src clj/s

(src edge)

Returns the source node of the edge

editable? clj/s

(editable? g)

Returns true if g satisfies the EditableGraph protocol

EditableGraph clj/s protocol

add-edges* clj/s

(add-edges* g edges)

Add edges to graph g. See add-edges

add-nodes* clj/s

(add-nodes* g nodes)

Add nodes to graph g. See add-nodes

remove-all clj/s

(remove-all g)

Removes all nodes and edges from graph g

remove-edges* clj/s

(remove-edges* g edges)

Removes edges from graph g. See remove-edges

remove-nodes* clj/s

(remove-nodes* g nodes)

Remove nodes from graph g. See remove-nodes

fly-graph clj/s

(fly-graph & {:keys [nodes edges successors predecessors weight start]})

Creates a read-only, ad-hoc graph which uses the provided functions to return values for nodes, edges, etc. If any members are not functions, they will be returned as-is. Edges can be inferred if nodes and successors are provided. Nodes and edges can be inferred if successors and start are provided.

FlyDigraph clj/s

FlyGraph clj/s

graph clj/s

(graph & inits)

Creates an unweighted, undirected graph. inits can be edges, adjacency maps, or graphs

Graph clj/s protocol

edges clj/s

(edges g)

Edges in g. May return each edge twice in an undirected graph

has-edge? clj/s

(has-edge? g n1 n2)

Returns true when edge [n1 n2] is in g

has-node? clj/s

(has-node? g node)

Returns true when node is in g

nodes clj/s

(nodes g)

Returns a collection of the nodes in graph g

out-degree clj/s

(out-degree g node)

Returns the number of outgoing edges of node

out-edges clj/s

(out-edges g node)

Returns all the outgoing edges of node

successors* clj/s

(successors* g node)

Returns direct successors of node

graph? clj/s

(graph? g)

Returns true if g satisfies the Graph protocol

predecessors clj/s

(predecessors g)

(predecessors g node)

Returns direct predecessors of node

remove-edges clj/s

(remove-edges g & edges)

Removes edges from graph g. Do not include weights

remove-nodes clj/s

(remove-nodes g & nodes)

Removes nodes from graph g

subgraph clj/s

(subgraph g ns)

Returns a graph with only the given nodes

successors clj/s

(successors g)

(successors g node)

Returns direct successors of node

weight clj/s

(weight g)

(weight g e)

(weight g n1 n2)

Returns the weight of edge e or edge [n1 n2]

weighted-digraph clj/s

(weighted-digraph & inits)

Creates an weighted, directed graph. inits can be edges, adjacency maps, or graphs

weighted-graph clj/s

(weighted-graph & inits)

Creates an weighted, undirected graph. inits can be edges, adjacency maps, or graphs

weighted? clj/s

(weighted? g)

Returns true if g satisfies the WeightedGraph protocol

WeightedFlyDigraph clj/s

WeightedFlyGraph clj/s

WeightedGraph clj/s protocol

weight* clj/s

(weight* g e)

(weight* g n1 n2)

Returns the weight of edge e or edge [n1 n2]