7.3 Kruskal’s Algorithm

Kruskal’s Algorithm was developed by JOSEPH KRUSKAL

Kruskal’s Algorithm Pick the cheapest link (edge) available and mark it Pick the next cheapest link available and mark it again Continue picking and marking link that does not create the circuit ***Kruskal’s algorithm is efficient and optimal

Apply Kruskal’s algorithm to find the minimum spanning tree

Apply Kruskal’s algorithm to find the minimum spanning tree MST: =24 10

Apply Kruskal’s algorithm to find the minimum spanning tree

B D H P W

Find the length of the shortest network connecting the three cities A, B, C shown in each figure. 37° 300 mi 250 mi 25° 212 mi Apply Kruskal’s Algorithm: Since we know that length AB is always longer than the other two edges, so we pick: 250 mi and 300 mi. MST = 550 mi This is an isosceles triangle so there must be two equal edges Apply Kruskal’s Algorithm: Since we know that length AB is always longer than the other two edges, so we pick: 212 mi and 212 mi. MST = 424 mi A B C A B C