-
Notifications
You must be signed in to change notification settings - Fork 146
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
Transitive closure #704
Labels
enhancement
New feature or request
good first issue
Good for newcomers
help wanted
Extra attention is needed
Comments
IvanIsCoding
added
good first issue
Good for newcomers
enhancement
New feature or request
labels
Oct 20, 2022
mtreinish
added a commit
to mtreinish/retworkx
that referenced
this issue
Oct 20, 2022
This commit adds a new function transitive_closure_dag() which is an optimized method for computing the transitive closure for DAGs. In support of this a new function descendants_at_distance() for finding the nodes a fixed distance from a given source to both rustworkx and rustworkx-core. Related to: Qiskit#704
I just opened up #707 which did the DAG optimized form of this function. Primarily because it looked more fun for me to implement, but I didn't mark that as closing this because it's not the general form which works with any graph. So if someone still wants to work on that they should feel free |
Can I be assigned, I'd like to take a look at this issue |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Labels
enhancement
New feature or request
good first issue
Good for newcomers
help wanted
Extra attention is needed
What is the expected enhancement?
Implementing a transitive closure function with similar functionality to the one in Networkx:
https://networkx.org/documentation/stable/reference/algorithms/generated/networkx.algorithms.dag.transitive_closure.html
The text was updated successfully, but these errors were encountered: