undergraduate, hw description:

Find the longest path in the residual network by inspection. (Note: finding the longest path in a network is NP-complete unless the network is acyclic.)

Labeling Algorithm Page 184