ISMAGS.analyze_subgraph_symmetry

ISMAGS.analyze_subgraph_symmetry()

Find a minimal set of permutations and corresponding co-sets that describe the symmetry of self.subgraph, given the node and edge equalities given by node_partition and edge_colors, respectively.

Returns:

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 than key.