analyze_symmetry(self, graph, node_partitions, edge_colors)

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 :None:None:`values` can be interchanged without changing nodes less than :None:None:`key`.

Find a minimal set of permutations and corresponding co-sets that describe the symmetry of subgraph .

Examples

See :

Local connectivity graph

Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.

Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)

SVG is more flexible but power hungry; and does not scale well to 50 + nodes.

All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them

---

GitHub : /networkx/algorithms/isomorphism/ismags.py#579
type: <class 'function'>
Commit: