Can you arrange the edges such that our implementations take time proportional to E to find each path in your example in
Exercise 22.32? If necessary, modify your example to achieve this goal. Describe the adjacency-lists representation that is constructed for your example. Explain how the worst case is achieved.
Exercise 22.32
Exhibit a family of networks for which the maximum-augmenting-path algorithm needs 2E lg M augmenting paths.