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

Add strongly & weakly connected components algorithms #56

Open

ooker777 opened this issue May 22, 2022 · 2 comments

Contributor

ooker777 commented May 22, 2022

No description provided.

Collaborator

HEmile commented May 23, 2022 •

edited

Loading

Do you mean give a single number that says how connected your graph is? Ah no, find a subgraph that's strongly connected?

Contributor Author

ooker777 commented May 23, 2022

hmm, perhaps we should have a list of connected components, and in each component we list all the nodes within it?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment