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

Notebook for Connected Components Algorithm #102

Open

PurviChaurasia opened this issue Mar 27, 2023 · 1 comment

PurviChaurasia commented Mar 27, 2023

Currently NetworkX provides various Algorithms to find connected connected components in graph. The functions for this are based on:

BFS based Algorithms
Kosaraju’s algorithm (strongly connected components)
Tarjan’s algorithm (strongly connected components)

I aim to create a notebook that will delve deeper into each of these algorithms and showcase how the connected components functions work in NetworkX.

Author

PurviChaurasia commented Mar 27, 2023

@MridulS @rossbar Kindly let me know if it would be a good idea to work on these notebooks for the GSoC/Outreachy period!

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