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.digraph_maximum_bisimulation#

digraph_maximum_bisimulation(graph)#

Calculates the relational coarsest partition otherwise known as the maximum bisimulation relation using the Paige-Tarjan algorithm described in “Three partition refinement algorithms”.

Parameters:

graph (PyDiGraph) – The graph to find the maximum bisimulation relation for

Returns:

The relational coarsest partition which is an iterator of NodeIndices.

Return type:

RelationalCoarsestPartition