If there are three trees of the same size, then the one with the smallest root should remain, and the other two trees should be merged. There will be one graph problem using one of the following formats. Fill in the following tables using Kruskal's algorithm to find the minimum spanning tree of the graph. For a union of sets of the same size, the new root should be the old root with the lower array index. Stop the process when you have a minimum spanning tree.
Weights are to the left of internal edges.
Based on your tables, draw the minimum spanning tree of the graph. Choosing the augmenting path that allows the largest increase in flow, find the maximum network flow for the following graph, G. Internal flows are to the left of their respective edges. Your score will be based on your completion of the augmented path line, G f and G r , including their initial states and back-flow edges where appropriate. Using the method described in Weiss, determine the strongly connected components of the following graph, and write them on the lines provided. List each strongly connected component one per line.