com.gfredericks.graphs.algorithms — com.gfredericks/graphs 0.3.5

all-pairs clj

(all-pairs order)

all-pairs-distances clj

(all-pairs-distances g)

automorphisms clj

(automorphisms x)

connected-components clj

(connected-components g)

connected? clj

(connected? g)

connectivity clj

(connectivity g)

Measures vertex-connectivity.

degrees clj

(degrees g)

Given a graph, returns a map from vertex numbers to their degree.

disconnected-subgraphs clj

(disconnected-subgraphs g order)

distance clj

(distance g v1 v2)

Returns an integer distance, or nil if the vertices are not in the same connected component

distances-per-node clj

(distances-per-node g)

Returns a map from each node to the sum of its distances to all other nodes.

distances-through clj

(distances-through ds node)

edge-connectivity clj

(edge-connectivity g)

induced-subgraph clj

(induced-subgraph g coll)

g is a graph, coll is a collection of vertices. Returns the induced subgraph with vertices labeled 0 to n-1 (as normal) corresponding to the supplied vertices in sorted order.

isomorphic? clj

(isomorphic? g1 g2)

isomorphisms clj

(isomorphisms g1 g2)

(isomorphisms g1-edges g2-edges mapping tos-left)

Returns a lazy seq of all permutations that transform g1 into g2.

permute clj

(permute g p)

Given a graph and a permutation (which is some sort of (vec (shuffle (range order)))), returns a new graph with the vertices permuted according to the permutation.

shortest-path clj

(shortest-path g start end)

Returns a sequence of vertices starting with start and ending with end, or nil if the two vertices are not connected.

unfairness clj

(unfairness g)