This project provides utilites pertaining to undirected Graphs. This project can be used as an API for storing graphs as adjacency Lists, computing paths between vertices or many other applications of Breadth First Search, Depth First Search and Connected Components which are provided in this project.
- Aayushya Vajpayee
For License - see the LICENSE.md file for details
- The concepts in the code have been majorly learnt from Robert Sedgewick (Instructor of the algorithms course of Princeton University on coursera)