For the graphs in Problem 5-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 A.
(d) Compute the maximum flow from A to H.
Problem 5-1
For the following graphs G1 (left) and G2 (right):
(a) Report the order of the vertices encountered on a breadth-first search starting from vertex A. Break all ties by picking the vertices in alphabetical order (i.e., A before Z).
(b) Report the order of the vertices encountered on a depth-first search starting from vertex A. Break all ties by picking the vertices in alphabetical order (i.e., A before Z).