Fill in the increment for each row. There may be more rows than needed. 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. Please note that this problem does not reflect reality. It is just an ECS 10 problem placed within a familiar context.