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

Notebook for Connected Components Algorithm #102

Open
PurviChaurasia opened this issue Mar 27, 2023 · 1 comment
Open

Notebook for Connected Components Algorithm #102

PurviChaurasia opened this issue Mar 27, 2023 · 1 comment

Comments

@PurviChaurasia
Copy link

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

  1. BFS based Algorithms
  2. Kosaraju’s algorithm (strongly connected components)
  3. 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.
@PurviChaurasia
Copy link
Author

@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
Assignees
No one assigned
Labels
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@PurviChaurasia