Jump to navigation Jump to search
Weighted Graph Algorithms
Simulating Graph Algorithms
- 8.1. For the graphs in Problem 7-1:
- (a) Draw the spanning forest after every iteration of the main loop in Kruskal’s algorithm.
- (b) Draw the spanning forest after every iteration of the main loop in Prim’s algorithm.
- (c) Find the shortest-path spanning tree rooted in .
- (d) Compute the maximum flow from to .
Minimum Spanning Tree
Network Flow and Matching
Back to Chapter List