Find the next augmenting path for Edmonds-Karp

Computer Science Level 3

In the Edmonds-Karp Algorithm, the set of augmenting paths to choose from is well defined. Which of the following options will be the next augmenting path chosen by Edmonds-Karp?

The following graph shows a set of vertices and edges. Each edges shows two numbers: its current flow divided by its capacity. In this implementation, vertices are processed in alphabetical order for search.

Graph in the middle of Edmonds-Karp

Graph in the middle of Edmonds-Karp


Problem Loading...

Note Loading...

Set Loading...