Notebook for Connected Components Algorithm

[PurviChaurasia]

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]

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