eric035 / ford-fulkerson-maximum-flow Goto Github PK
View Code? Open in Web Editor NEWGiven a WGraph object (.txt file), the Ford-Fulkerson java class will compute the maximum flow of the graph's flow network. As long as there is a path from the source (start node) to the sink (end node), with available capacity on all edges in the path, we send flow along one of the paths. Then we find another path, and so on. A path with available capacity is called an augmenting path.