ISMAGS.largest_common_subgraph#
- ISMAGS.largest_common_subgraph(symmetry=True)[source]#
Find the largest common induced subgraphs between
subgraph
andgraph
.- Parameters:
- symmetry: bool
Whether symmetry should be taken into account. If False, found largest common subgraphs may be symmetrically equivalent.
- Yields:
- dict
The found isomorphism mappings of {graph_node: subgraph_node}.