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.

Sign up for GitHub

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

Jump to bottom

Strongly-connected components #2

Open
cbbowen opened this issue Apr 8, 2018 · 0 comments
Open

Strongly-connected components #2

cbbowen opened this issue Apr 8, 2018 · 0 comments
Labels
enhancement New feature or request

Comments

@cbbowen
Copy link
Owner

cbbowen commented Apr 8, 2018

An efficient algorithm for computing strongly-connected components should be added. The result should be a view of the graph which is itself a tree of components. It should support querying the component of a vertex of the original graph and finding paths between vertices in a component.
@cbbowen cbbowen added the enhancement New feature or request label Apr 8, 2018
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
enhancement New feature or request
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@cbbowen