Graph Algorithms Edmonds Karp Algorithm for maximum flow Edmondsâ€“Karp algorithm is an optimized implementation of the Fordâ€“Fulkerson method for computing the maximum flow in a flow network in O(V E^2) time instead of O(E |max_flow|) in case of Ford-Fulkerson algorithm.

Graph Algorithms Dinic's algorithm for Maximum flow in a graph Dinic's algorithm or Dinitz's algorithm is a strongly polynomial algorithm for computing the maximum flow in a flow network. The basic principle is that a Maximum flow = minimum cut and Breadth First Search is used as a sub-routine.

Graph Algorithms Ford Fulkerson Algorithm for Maximum flow in a graph Fordâ€“Fulkerson algorithm is a greedy algorithm that computes the maximum flow in a flow network. The main idea is to find valid flow paths until there is none left, and add them up. It uses Depth First Search as a sub-routine.