loom.alg
Graph algorithms. Any graph record/type that satisfies the Graph, Digraph, or WeightedGraph protocols (as appropriate per algorithm) can use these functions.
Graph algorithms. Any graph record/type that satisfies the Graph, Digraph, or WeightedGraph protocols (as appropriate per algorithm) can use these functions.
- all-pairs-shortest-paths
- astar-dist
- astar-path
- bellman-ford
- bf-all-pairs-shortest-paths
- bf-path
- bf-path-bi
- bf-span
- bf-traverse
- bipartite-color
- bipartite-sets
- bipartite?
- coloring?
- connect
- connected-components
- connected?
- dag?
- degeneracy-ordering
- density
- dijkstra-path
- dijkstra-path-dist
- dijkstra-span
- dijkstra-traverse
- distinct-edges
- eql?
- greedy-coloring
- isomorphism?
- johnson
- loners
- longest-shortest-path
- max-flow
- maximal-cliques
- post-traverse
- pre-span
- pre-traverse
- prim-mst
- prim-mst-edges
- scc
- shortest-path
- strongly-connected?
- subgraph?
- topsort
loom.alg-generic
Graph algorithms for use on any type of graph
Graph algorithms for use on any type of graph
- ancestor?
- ancestors
- Ancestry
- ancestry-add
- ancestry-contains?
- ancestry-new
- ancestry-nodes
- bf-path
- bf-path-bi
- bf-paths-bi
- bf-span
- bf-traverse
- bits-per-long
- bm-get
- bm-get-indicies
- bm-longs
- bm-new
- bm-or
- bm-set
- dijkstra-path
- dijkstra-path-dist
- dijkstra-span
- dijkstra-traverse
- paths
- post-edge-traverse
- post-traverse
- pre-edge-traverse
- pre-span
- pre-traverse
- preds->span
- topsort-component
- trace-path
- trace-paths
loom.attr
Graph attribute protocol and implementations for records from loom.graph. Common uses for attributes include labels and styling (color, thickness, etc).
Graph attribute protocol and implementations for records from loom.graph. Common uses for attributes include labels and styling (color, thickness, etc).
loom.derived
Defines derived graphs from existing graphs using maps and filters.
Defines derived graphs from existing graphs using maps and filters.
loom.flow
Algorithms for solving network flow
Algorithms for solving network flow
loom.graph
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.
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*
- add-cycle
- add-edges
- add-nodes
- add-path
- BasicEditableDigraph
- BasicEditableGraph
- BasicEditableWeightedDigraph
- BasicEditableWeightedGraph
- build-graph
- default-digraph-impl
- default-graph-impls
- default-weighted-graph-impl
- Digraph
- digraph
- directed?
- Edge
- editable?
- EditableGraph
- fly-graph
- FlyDigraph
- FlyGraph
- graph
- Graph
- graph?
- predecessors
- remove-edges
- remove-nodes
- subgraph
- successors
- weight
- weighted-digraph
- weighted-graph
- weighted?
- WeightedFlyDigraph
- WeightedFlyGraph
- WeightedGraph
loom.io
Output and view graphs in various formats
Output and view graphs in various formats
loom.label
Graph label protocol and implementations for records from loom.graph
Graph label protocol and implementations for records from loom.graph
loom.network-simplex
Network simplex algorithm for solving network flow
Network simplex algorithm for solving network flow
cljdoc is a website building & hosting documentation for Clojure/Script libraries
× close