com.yetanalytics.pan.graph
add-edgesclj/s
(add-edges g edges)Add a list or vector of directed edges to a graph, where each node has the form [src dest attr-map].
Add a list or vector of directed edges to a graph, where each node has the form [src dest attr-map].
add-nodesclj/s
(add-nodes g nodes)Add a list or vector of nodes to a graph, where each node has the form [node attr-map].
Add a list or vector of nodes to a graph, where each node has the form [node attr-map].
attrclj/s
(attr g node-or-edge attr)Return the attribute of a particular node or edge in a graph.
Return the attribute of a particular node or edge in a graph.
collect-edgesclj/s
(collect-edges attr-edges)Flatten a collection of edges (ie. vectors of form [src dest attrs] such that it is a 1D vector of vectors.
Flatten a collection of edges (ie. vectors of form [src dest attrs] such that it is a 1D vector of vectors.
create-graphclj/s
(create-graph node-objs edge-objs)Create a graph with node-objs and edge-objs, which should be
coerceable by node-with-attrs and edges-with-attrs,
respectively.
Create a graph with `node-objs` and `edge-objs`, which should be coerceable by `node-with-attrs` and `edges-with-attrs`, respectively.
create-graph*clj/s
(create-graph* nodes edges)Create a graph with nodes and edges.
Create a graph with `nodes` and `edges`.
destclj/s
(dest edge)Return the destination node of a directed edge.
Return the destination node of a directed edge.
edgesclj/s
(edges g)Given a graph, return its edges.
Given a graph, return its edges.
in-degreeclj/s
(in-degree g node)Return the in-degree of a node in a digraph.
Return the in-degree of a node in a digraph.
new-digraphclj/s
(new-digraph)Init a new directed graph.
Init a new directed graph.
nodesclj/s
(nodes g)Given a graph, return its nodes.
Given a graph, return its nodes.
out-degreeclj/s
(out-degree g node)Return the out-degree of a node in a digraph.
Return the out-degree of a node in a digraph.
sccclj/s
(scc g)Return the strongly-connected components of a digraph as a vector of vectors. Uses Kosaraju's algorithm.
Return the strongly-connected components of a digraph as a vector of vectors. Uses Kosaraju's algorithm.
srcclj/s
(src edge)Return the source node of a directed edge.
Return the source node of a directed edge.
cljdoc is a website building & hosting documentation for Clojure/Script libraries
× close