This repository aims at performing certain algorithms in graphs for specific situations:
1)Shortest path problems: 1)Dijkstra's algorithm 2)Bellmann Ford algorithm(Dynamic programming) 3)Floyd's algorihtm
2)Minimum spanning tree: 1)Prim's algorithm 2)Kruskal's algorithm
3)Graph traversal algorithms: 1)Breadth first search algorithm 2)Depth first search algorithm