Solutions for some very interseting and importent graph problems.
#Graphs Data structure used - Adjacency matrix (Except for Topological sorting)
- Comparision of minimum spanning tree algorithms (PRIMS and KRUSKALS)
- Graph Travesersal Algorithms - Breadth first search(BFS) and Depth first search(DFS)
- DFS Solution to Maxflow problem
- Shortest Path algorthims - Dijkstras , Bellman ford for SSSP problem Floyd-Warshall Algorithm for All pair shortest path problem
#Data_structures_implemented(ADDITIONAL)
- AVL tree - Along with Bst , for comparision
- Binary heap - A very easy and small implementation for binomial heap