Add function to compute the maximum bisimulation of a graph

[sander-hergarten]

What is the expected enhancement?

Compute the maximum bisimulation natively in rust. A native rust implementation of algorithms such as Paige-Tarjan would be significantly faster than anything in python.

There are decent native python implementation i have found but unfortunately they don't scale well to large graphs:
https://github.com/fandreuz/BisPy

[sander-hergarten]

Since i need this functionality for a project i am working on i would implement this anyways. This is more to see if this is something i can make a pull request for afterwords.

[IvanIsCoding]

Pull requests are welcome! I think if you submit Paige-Tarjan to rustworkx it will get merged.

You already have the algorithm you want to implement in mind. Check the contributing guide and once you have a draft feel free to start the request