cljgrapht.core — net.clojars.savya/cljgrapht 1.1.1

Idiomatic construction and inspection of graphs backed by JGraphT.

Vertices are arbitrary Clojure values (keywords, strings, numbers, maps). Graphs are JGraphT's native mutable objects: constructors and mutators return the same graph for threading, but they mutate in place (this is a performance wrapper, not a persistent data structure). Algorithms live in cljgrapht.algo and return plain Clojure data.

add-edge clj

(add-edge g u v)

(add-edge g u v w)

Add an edge u -> v (optionally with weight w) to g, adding the vertices if absent. Returns g.

add-vertex clj

(add-vertex g v)

Add vertex v to g, returning g.

all-edges clj

(all-edges g u v)

The set of edge objects from u to v in g.

contains-edge? clj

(contains-edge? g u v)

Whether g contains an edge from u to v.

contains-vertex? clj

(contains-vertex? g v)

Whether g contains vertex v.

degree clj

(degree g v)

The degree of vertex v in g.

digraph clj

(digraph)

(digraph edges)

A directed graph. Optional edges is a seq of [u v] pairs.

directed? clj

(directed? g)

Whether g is directed.

edge-reversed-view clj

(edge-reversed-view g)

A view of directed graph g with all edge directions reversed.

edge-source clj

(edge-source g edge)

The source vertex of edge in g.

edge-target clj

(edge-target g edge)

The target vertex of edge in g.

edges clj

(edges g)

A seq of edges in g: [u v] pairs, or [u v w] triples when g is weighted.

endpoints clj

(endpoints g edge)

The [source target] endpoints of edge in g.

get-edge clj

(get-edge g u v)

The edge object from u to v in g, or nil.

graph clj

(graph)

(graph edges)

An undirected graph. Optional edges is a seq of [u v] pairs.

graph-type clj

(graph-type g)

The JGraphT graph type of g as a Clojure map.

in-degree clj

(in-degree g v)

The incoming degree of vertex v in g.

incident-edges clj

(incident-edges g v)

A seq of rendered edges incident to vertex v in g.

incoming-edges clj

(incoming-edges g v)

A seq of rendered edges incoming to vertex v in g.

make-graph clj

(make-graph opts)

Build a graph from options controlling its type, suppliers, and initial edges.

neighbors clj

(neighbors g v)

Vertices adjacent to v in g (direction-agnostic).

order clj

(order g)

The number of vertices in g.

out-degree clj

(out-degree g v)

The outgoing degree of vertex v in g.

outgoing-edges clj

(outgoing-edges g v)

A seq of rendered edges outgoing from vertex v in g.

predecessors clj

(predecessors g v)

Vertices with an edge into v in g.

remove-edge clj

(remove-edge g edge)

(remove-edge g u v)

Remove an edge from g by endpoints or by edge object, returning g.

remove-vertex clj

(remove-vertex g v)

Remove vertex v and its incident edges from g, returning g.

set-weight clj

(set-weight g u v w)

Set the weight of edge u -> v to w, returning g.

size clj

(size g)

The number of edges in g.

subgraph clj

(subgraph g vertex-subset)

(subgraph g vertex-subset edge-subset)

A view of g over a vertex subset and optional edge-object subset.

successors clj

(successors g v)

Vertices reachable from v by an outgoing edge in g.

undirected-view clj

(undirected-view g)

An undirected view of directed graph g.

unmodifiable-view clj

(unmodifiable-view g)

An unmodifiable view of g.

unweighted-view clj

(unweighted-view g)

An unweighted view of g.

vertices clj

(vertices g)

The set of vertices in g.

weight clj

(weight g u v)

The weight of the edge u -> v in g.

weighted-digraph clj

(weighted-digraph)

(weighted-digraph edges)

A directed weighted graph. Optional edges is a seq of [u v w] triples.

weighted-graph clj

(weighted-graph)

(weighted-graph edges)

An undirected weighted graph. Optional edges is a seq of [u v w] triples.

weighted-view clj

(weighted-view g weights)

A weighted view of g using a map from edge objects to weights.

weighted? clj

(weighted? g)

Whether g supports edge weights.