Ford Fulkerson Algorithm for Maximum flow in a graph

graph-algorithm
maximum-flow
ford-fulkerson

(Team) #1

Reading time: 15 minutes | Coding time: 9 minutes

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.


This is a companion discussion topic for the original entry at http://iq.opengenus.org/ford-fulkerson-algorithm/