Exercises
• 22.133 Show that, when the network simplex algorithm is computing a maxflow, the spanning tree is the union of t-s, a tree containing s and a tree containing t.
22.134 Develop a maxflow implementation based on Exercise 22.133. Choose an eligible edge at random.
22.135 Show, in the style of Program 22.50, the process of computing a maxflow in the flow network shown in Program 22.10 using the reduction described in the text and the network simplex implementation of Program 22.14.
22.136 Show, in the style of Program 22.50, the process of finding shortest paths from 0 in the flow network shown in Program 22.10 using the reduction described in the text and the network simplex implementation of Program 22.14.
• 22.137 Prove that all edges ...
Get Algorithms in C++ Part 5: Graph Algorithms, Third Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
