Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsMaximum flow algorithms

Ford-Fulkerson algorithm

Maximizing the flow

Report a typo

Find the maximum flow using the Ford-Fulkerson algorithm:

A network, consisting of 5 vertices and 7 edges with capacities assigned to them

Enter a number
___

Create a free account to access the full topic