Some properties of the directed graph, possibly used as isomoprhism invariants.
Some properties of the directed graph, possibly used as isomoprhism invariants.
(adjacency-matrix G m)returns the adjacency matrix of digraph G, G should be compact
returns the adjacency matrix of digraph G, G should be compact
(compact G)If the graph has unused vertices, then this compactifies to a zero-starting no gap isomorphic representation.
If the graph has unused vertices, then this compactifies to a zero-starting no gap isomorphic representation.
(out-in-degrees G m)Returns the out and in-degree pairs in a vector indexed by the nodes.
G is a directed graph, m is the number of nodes (graph may not be
compact)
Returns the out and in-degree pairs in a vector indexed by the nodes. `G` is a directed graph, `m` is the number of nodes (graph may not be compact)
cljdoc builds & hosts documentation for Clojure/Script libraries
| Ctrl+k | Jump to recent docs |
| ← | Move to previous article |
| → | Move to next article |
| Ctrl+/ | Jump to the search field |