What You will Learn?

• Graph Theory Introduction
• Problems in Graph Theory
• Depth First Search Algorithm
• Breadth First Search Algorithm
• Breadth First Search grid shortest path
• Topological Sort Algorithm
• Shortest/Longest path on a Directed Acyclic Graph (DAG)
• Dijkstra's Shortest Path Algorithm
• Dijkstra's Shortest Path Algorithm | Source Code
• Bellman Ford Algorithm
• Floyd Warshall All Pairs Shortest Path Algorithm
• Floyd Warshall All Pairs Shortest Path Algorithm | Source Code
• Bridges and Articulation points Algorithm
• Bridges and Articulation points source code
• Tarjans Strongly Connected Components algorithm
• Tarjans Strongly Connected Components algorithm source code
• Travelling Salesman Problem | Dynamic Programming
• Travelling Salesman Problem source code | Dynamic Programming
• Existence of Eulerian Paths and Circuits
• Eulerian Path Algorithm
• Eulerian Path Algorithm | Source Code
• Prim's Minimum Spanning Tree Algorithm
• Eager Prim's Minimum Spanning Tree Algorithm
• Eager Prim's Minimum Spanning Tree Algorithm | Source Code
• Max Flow Ford Fulkerson | Network Flow
• Max Flow Ford Fulkerson | Source Code
• Unweighted Bipartite Matching | Network Flow
• Mice and Owls problem | Network Flow
• Elementary Math problem | Network Flow
• Edmonds Karp Algorithm | Network Flow
• Edmonds Karp Algorithm | Source Code
• Capacity Scaling | Network Flow
• Capacity Scaling | Network Flow | Source Code
• Dinic's Algorithm | Network Flow
• Dinic's Algorithm | Network Flow | Source Code