Mathematical Programming 
FordFulkerson's Algorithm 

FordFulkerson FordFulkerson JavaScript demos: FAQ Japanese/English 
Maximum Flow ProblemGiven a connected graph G=(V,E), a capacity c:E>R+, and two nodes s and t, find a maximum st flow.Minimum Cut ProblemGiven a connected graph G=(V,E), a capacity c:E>R+, and two nodes s and t, find a minimum st cut.FordFulkerson Labeling Algorithm
JavaScript Source files:JavaScript DemosHere is a JavaScript illustrating the FordFulkerson Labeling Algorithm, which yields a maxflow and a mincut.See Also

Kenji Ikeda's Home Page 
Last Modified:
Tuesday, 01Sep2015 14:12:39 JST
