All implementations done in python.
Week 1
- Does path exist ? (DFS)
- Connected Components (DFS)
Week 2
- Check if graph is acyclic
- Toposort
- Segregating strongly connected components
Week 3
- BFS
- Bipartite
Week 4
- Dijkstra
- Bellman-Ford
- Finding the negative cycle
Week 5
- Kruskal's Algorithm
- Prim's Algorithm
- Clustering