Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsMaximum flow algorithms

Ford-Fulkerson algorithm

Theory

Reversed problem

Report a typo

Mary was trying to find the maximum flow of the following network with capacities:

Flow network

The sequence of augmenting paths that she found looks like this: A-D-E with a flow 44, A-B-D-C-E with a flow 55. Which algorithm did Mary use?

Select one option from the list
___

Create a free account to access the full topic