predecessors
and successors
add-directed-edges
and add-undirected-edges
.add-edges
to avoid confusion. build-graph
has the most sophisticated handling for Edge objects and is the best function to use to "import" Edges from other graphs. Alternatively, add-directed-edges
or add-undirected-edges
can extract a [src dest attribute-map] edge description from an Edge object and use that to create a new directed or undirected edge, respectively.predecessors
potentially returned duplicates. Now calls distinct
on output, matching the behavior of successors
.ubergraph?
predicate.ubergraph->edn
and edn->ubergraph
as a way to serialize and deserialize ubergraphs.viz-graph
can now take graph attributes in the opts map. (Thanks to masztal for this PR).nodes
on a graph now returns a seq, not a keySet.undirected-graph?
, allow-parallel-edges?
, ubergraph
nodes
add-edges
Can you improve this documentation?Edit on GitHub
cljdoc is a website building & hosting documentation for Clojure/Script libraries
× close