Find the augmenting path in the following graph
Which of the following paths is an augmenting path for the graph below?
The following graph shows a set of vertices and edges. Each edge shows two numbers: its current flow divided by its capacity.
Graph in the middle of a max flow algorithm
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
{source, a, b, c, d, sink} is one augmented path. If we pass a single car more, it will fill up most of the pipes.
There are others as a subset of this path, but from the answers given, it's the only correct one