Note

This is the documentation for the current state of the development branch of rustworkx. The documentation or APIs here can change prior to being released.

rustworkx.is_isomorphic#

is_isomorphic(first, second, node_matcher=None, edge_matcher=None, id_order=True, call_limit=None)[source]#

Determine if 2 graphs are isomorphic

This checks if 2 graphs are isomorphic both structurally and also comparing the node and edge data using the provided matcher functions. The matcher functions take in 2 data objects and will compare them. A simple example that checks if they’re just equal would be:

graph_a = rustworkx.PyGraph()
graph_b = rustworkx.PyGraph()
rustworkx.is_isomorphic(graph_a, graph_b,
                    lambda x, y: x == y)

Note

For better performance on large graphs, consider setting id_order=False.

Parameters:

  • first – The first graph to compare. Can either be a PyGraph or PyDiGraph.

  • second – The second graph to compare. Can either be a PyGraph or PyDiGraph. It should be the same type as the first graph.

  • node_matcher (callable) – A python callable object that takes 2 positional one for each node data object. If the return of this function evaluates to True then the nodes passed to it are viewed as matching.

  • edge_matcher (callable) – A python callable object that takes 2 positional one for each edge data object. If the return of this function evaluates to True then the edges passed to it are viewed as matching.

  • id_order (bool) – If set to False this function will use a heuristic matching order based on [VF2] paper. Otherwise it will default to matching the nodes in order specified by their ids.

  • call_limit (int) – An optional bound on the number of states that VF2 algorithm visits while searching for a solution. If it exceeds this limit, the algorithm will stop and return False.

Returns:

True if the 2 graphs are isomorphic, False if they are not.

Return type:

bool

[VF2]

VF2++ An Improved Subgraph Isomorphism Algorithm by Alpár Jüttner and Péter Madarasi