Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Add function to compute the maximum bisimulation of a graph #1075

Closed
sander-hergarten opened this issue Jan 31, 2024 · 3 comments
Closed

Add function to compute the maximum bisimulation of a graph #1075

sander-hergarten opened this issue Jan 31, 2024 · 3 comments
Labels
enhancement New feature or request

Comments

@sander-hergarten
Copy link
Contributor

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
Copy link
Contributor Author

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 IvanIsCoding added the enhancement New feature or request label Feb 2, 2024
@IvanIsCoding
Copy link
Collaborator

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

@IvanIsCoding
Copy link
Collaborator

Closed by #1089

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
enhancement New feature or request
Projects
None yet
Development

No branches or pull requests

2 participants