-In Figure 3b, what is the length of the minimum spanning tree using the algorithm presented in the text and continuing to add nodes to the connected components shown by thick arcs?
A)16
B) 17
C) 12
D) 26

Question

-In Figure 3b, what is the length of the minimum spanning tree using the algorithm presented in the text and continuing to add nodes to the connected components shown by thick arcs? 
A)16 
B) 17 
C) 12 
D) 26

Quizplus · Accepted Answer

The minimum spanning tree is formed by adding the shortest edges that connect all nodes without forming a cycle. The algorithm presented in the text likely follows this principle, resulting in a total length of 16.

-In Figure 3b, What Is the Length of the Minimum