Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsMaximum flow algorithms

Ford-Fulkerson algorithm

Choosing a path

Report a typo

What is the second augmenting path that the Edmonds-Karp algorithm will choose?

A network, consisting of 6 vertices and 8 edges with capacities assigned to them

Please write the nodes in the answer field without any separating symbols. For example, if a path goes through the vertices X, W, and K, write XWK.

Enter a short text

___

Create a free account to access the full topic