Deciding directed graph isomorphism. Directed graphs (digraphs) are sequences of source-target pairs. Vertices are non-negative integers.
Deciding directed graph isomorphism. Directed graphs (digraphs) are sequences of source-target pairs. Vertices are non-negative integers.
(digraph-isomorphisms G H)(digraph-isomorphisms G H m)Logic search for all isomorphisms of directed graph G to H given as
a collection of arrows (ordered pair of integers). m is the number of
vertices, when not given it is inferred from the graphs.
Logic search for all isomorphisms of directed graph `G` to `H` given as a collection of arrows (ordered pair of integers). `m` is the number of vertices, when not given it is inferred from the graphs.
(digraphs-up-to-morphisms digraphs)(digraphs-up-to-morphisms digraphs representatives)Given a collection of directed graphs, it returns the isomorphism class representatives.
Given a collection of directed graphs, it returns the isomorphism class representatives.
(iso-conj reps G)Conjoining G in case it is not isomorphic to any of the digraphs in reps,
otherwise returning reps unchanged.
Conjoining `G` in case it is not isomorphic to any of the digraphs in `reps`, otherwise returning `reps` unchanged.
(isomorphic? G H)Computes signature first for both graphs, if they match, it calls the
heavier digraph-isomorphisms.
Computes [[signature]] first for both graphs, if they match, it calls the heavier [[digraph-isomorphisms]].
(signature G)Just a quick graph isomorphism invariant: in-degrees sorted concatenated with out-degrees sorted.
Just a quick graph isomorphism invariant: in-degrees sorted concatenated with out-degrees sorted.
(signature2 G m)Frequencies of #paths of length 2 between nodes.
Frequencies of #paths of length 2 between nodes.
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 |