Liking cljdoc? Tell your friends :D
Clojure only.

com.gfredericks.graphs

Functions for manipulation of undirected graphs. Since this is intended for study of the mathematical objects rather than graph-like data, the vertex set is restricted to (range n).

Functions for manipulation of undirected graphs. Since this is
intended for study of the mathematical objects rather than
graph-like data, the vertex set is restricted to (range n).
raw docstring

add-edgeclj

(add-edge g e)
source

edge?clj

(edge? g e)
source

edgesclj

(edges _)

Returns a list of vertex pairs. Should be considered unordered.

Returns a list of vertex pairs. Should be considered unordered.
sourceraw docstring

emptyclj

(empty g)
source

neighborsclj

(neighbors g v)
source

orderclj

(order g)
source

rand-graphclj

(rand-graph n)
(rand-graph n p)
(rand-graph n p r)

Returns a random graph of the given order where each edge exists with probability p (default 0.5).

Returns a random graph of the given order where each edge exists
with probability p (default 0.5).
sourceraw docstring

remove-edgeclj

(remove-edge g e)
source

vector-graphclj

(vector-graph order & edges)
source

verticesclj

(vertices g)
source

cljdoc is a website building & hosting documentation for Clojure/Script libraries

Keyboard shortcutsReport a problemcljdoc on GitHub
× close