A variation of the Ford-Fulkerson algorithm that uses the breadth-first search strategy to find the maximum flow in a network flow graph.
A variation of the Ford-Fulkerson algorithm that uses the breadth-first search strategy to find the maximum flow in a network flow graph.