We'll cover the following topics in this section:

• Graph Theory Introduction
• Problems in Graph Theory
• Depth First Search algorithm
• Breadth First Search algorithm
• Breadth First Search grid shortest path
• Dijkstra's shortest path algorithm
• Dijkstra's shortest path algorithm | source code
• Topological sort algorithm
• Shortest/longest path on a Directed Acyclic Graph (DAG)
• Bellman-Ford algorithm
• Floyd-Warshall all pairs shortest path algorithm
• Floyd-Warshall all pairs shortest path algorithm | source code
• Bridges & Articulation points
• Bridges & Articulation points | source code
• Tarjan's strongly connected components algorithm
• Tarjan's strongly connected components algorithm | source code
• Travelling Salesman problem
• Travelling Salesman problem | source code
• Existence of Eulerian path and circuits
• Eulerian path algorithm
• Eulerian path source code
• Max Flow Ford Fulkerson | Network Flow
• Max Flow Ford Fulkerson | source code
• Unweighted bipartite matching | Network flow
• Mice and Owls | Network Flow
• Elementary Math | Network Flow
• Edmonds Karp | Network Flow
• Edmonds Karp | Network Flow | Source Code
• Capacity Scaling | Network Flow
• Capacity Scaling | Network Flow | Source Code
• Dinic's Algorithm | Network Flow
• Dinic's Algorithm | Network Flow | Source Code