Notebook for Shortest Path Algorithms

[vanshika230]

I wish to create a Notebook explaining the following algorithms on weighted graphs as linked Here

1. Floyd- Warshall Algorithm
2. Bellman- Ford Algorithm
3. Dijkstra's Algorithm
4. A* Algorithm

   Steps that I would be following for the notebook if given the opportunity:

5. Brief History and Introduction of Algorithms
6. Example and In depth explanation of each function with code
7. Real-life Application to transport routes for better understanding
8. Conclusion

Resources I plan on using:-

1. Dataset from :-https://snap.stanford.edu/data/index.html
2. Books :-
   • Graph Theory with Applications to Engineering and Computer Science by Narsingh Deo
   • Introduction to Graph Theory by Douglas B West
3. Research Papers
   • https://iopscience.iop.org/article/10.1088/1742-6596/1217/1/012116/meta
   • https://iopscience.iop.org/article/10.1088/1742-6596/1217/1/012116/pdf I shall also be referring to various articles and more papers which I will document later in references.

Why trust me for making this notebook?

I have experience in writing efficient code with in-depth documentation. I have written several tutorial jupyter notebooks as a few examples here:-

1. https://www.kaggle.com/code/mvanshika/diabetes-prediction
2. https://github.com/vanshika230/Machine-Learning

Please suggest any improvements required and review this request. @MridulS @rossbar .Thankyou for your time and consideration.