Maximum Flow, Minimum Cut and the Ford-Fulkerson Method
Today I’m studying flow graphs and disjoint sets data structure. Maximum flow falls into the category of combinatoric optimization problems. The Ford-Fulkerson method, published in 1956, is a way of solving the computation of maximum flow through a flow graph, which could represent a network…
Read more