Ford-Fulkerson is an algorithm that solves network flow problem. Network flow are nodes and edges that connects the nodes. Each edge has the limit how much flow is allowed to run. Network flow problem is to know how much flow can run at the same time from start node to goal node.
1
Ford-Fulkerson in 5 minutes
