advent-utils.graph — advent-utils 0.1.4

adjacencies clj

(adjacencies graph)

all-paths clj

(all-paths g v & {:keys [excludes]})

Find all the paths from a vertex reaching a leaf vertex or a vertex with more than one untraversed edges

degree clj

(degree g v)

The degree of a vertex is the number of edges it has

dijkstra clj

(dijkstra graph start finish & {:keys [limit]})

Executes Dijkstra's algorithm to identify the shortest path between the start and finish vertices

dijkstra-retrace clj

(dijkstra-retrace prev-steps finish)

dijkstra-update clj

(dijkstra-update graph vertex {:keys [dist prev queue] :as state} neighbor)

entries-in-set clj

(entries-in-set s m)

entries-not-in-set clj

(entries-not-in-set s m)

Graph clj protocol

distance clj

(distance this v1 v2)

The distance (or edge weight) between two vertices

edges clj

(edges this v)

A collection of the edges for the given vertex in the graph

rewired-without-vertex clj

(rewired-without-vertex this v)

Produces a new graph, re-wired to preserve the transitive edges through the removed vertex

vertex clj

(vertex this v)

Any data/information/label associated with the given vertex in the graph

vertices clj

(vertices this)

A collection of all the vertices in the graph

without-vertex clj

(without-vertex this v)

Produces a new graph with the vertex removed

junction? clj

(junction? g v)

Whether a vertex is a junction (meaning that it has more than two edges)

LabeledMapGraph clj

leaf? clj

(leaf? g v)

Whether a vertex is a leaf vertex (meaning that it has at most one edge)

MapGraph clj

path-distance clj

(path-distance g path)

Computes the distance along a path (an ordered collection of vertices)

pruned clj

(pruned graph exclude-set)

Prunes the single branches from a graph, excluding any vertices in the exclude-set

reachable clj

(reachable graph start stop-cond)

shortest-distance clj

(shortest-distance graph start finish)

single-path clj

(single-path g v & {:keys [exclude]})

Return the only possible path traversal from the start vertex (presumed to be a leaf vertex) until reaching another leaf vertex or a vertex with more than one un-traversed edge

single-path-2 clj

(single-path-2 g v s stop-at)

Return the only possible path traversal from the start vertex (presumed to be a leaf vertex) until reaching another leaf vertex or a vertex with more than one un-traversed edge

summarize-path clj

(summarize-path g path)