Use Kruskal's algorithm to find a minimal cost spanning tree for a graph whose vertices are labeled \(\{1,2, \ldots, 8\}\) and whose edges have the costs below:

Transcribed Image Text:

146 51 25 321 1321 - - - - 2 - 21 - 8130 46 - 4 6358 54 +31 - 4 13214 - 32 26358 || 1011 |- | | | edge cost edge cost {1, 2} 2 {3, 7} 4 2 - {1,3} 2 {4, 5} 5 4 3 {1,4} 1 {4,6} 3 - {2, 3} 2 {5, 6} 6 {3, 4} 3 {6, 7} 1 {3, 6} 2 (7,8) 2 Exercise 1 Exercise 2