__init__(self, graph, subgraph, node_match=None, edge_match=None, cache=None)

Parameters

graph: networkx.Graph :

subgraph: networkx.Graph :

node_match: collections.abc.Callable or None :

Function used to determine whether two nodes are equivalent. Its signature should look like f(n1: dict, n2: dict) -> bool , with :None:None:`n1` and :None:None:`n2` node property dicts. See also ~networkx.algorithms.isomorphism.categorical_node_match and friends. If :None:None:`None`, all nodes are considered equal.

edge_match: collections.abc.Callable or None :

Function used to determine whether two edges are equivalent. Its signature should look like f(e1: dict, e2: dict) -> bool , with e1 and e2 edge property dicts. See also ~networkx.algorithms.isomorphism.categorical_edge_match and friends. If :None:None:`None`, all edges are considered equal.

cache: collections.abc.Mapping :

A cache used for caching graph symmetries.

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#270
type: <class 'function'>
Commit: