networkx.algorithms.isomorphism.ISMAGS.analyze_symmetry¶
-
ISMAGS.
analyze_symmetry
(graph, node_partitions, edge_colors)[source]¶ Find a minimal set of permutations and corresponding co-sets that describe the symmetry of
subgraph
.- Returns
set[frozenset] – The found permutations. This is a set of frozenset of pairs of node keys which can be exchanged without changing
subgraph
.dict[collections.abc.Hashable, set[collections.abc.Hashable]] – The found co-sets. The co-sets is a dictionary of {node key: set of node keys}. Every key-value pair describes which
values
can be interchanged without changing nodes less thankey
.