canonical.permutation {igraph} | R Documentation |
Canonical permutation of a graph
Description
canonical.permutation()
was renamed to canonical_permutation()
to create a more
consistent API.
Usage
canonical.permutation(
graph,
colors = NULL,
sh = c("fm", "f", "fs", "fl", "flm", "fsm")
)
Arguments
graph |
The input graph, treated as undirected. |
colors |
The colors of the individual vertices of the graph; only
vertices having the same color are allowed to match each other in an
automorphism. When omitted, igraph uses the |
sh |
Type of the heuristics to use for the BLISS algorithm. See details for possible values. |
[Package igraph version 2.0.3 Index]