List the order in which the edges of the graph in Figure 11.25 are visited when running

Question:

List the order in which the edges of the graph in Figure 11.25 are visited when running Kruskal’s MST algorithm. 

10 3 2 3 2 20 5 15 6 10 3 5 11

Each time an edge is added to the MST, show the result on the equivalence array, (e.g., show the array as in Figure 6.7).

A BCD 0 1 2 3 EFGH I J 4 5 6 7 8 9 o A B C D EFGH 0 1 2 3 4 5 6 3 5 2 5 A 005 3 5 25 A BCD E F G HI J 01 23 4

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Question Posted: