-In Figure 3a, bold arc and all nodes attached to it is the connected node. Using the algorithm in the text for finding the minimal spanning tree, which will be the next node added to the set of connected nodes?
A) 3
B) 6
C) 4
D) 5

Question

-In Figure 3a, bold arc and all nodes attached to it is the connected node. Using the algorithm in the text for finding the minimal spanning tree, which will be the next node added to the set of connected nodes? 
A) 3 
B) 6 
C) 4 
D) 5

Quizplus · Accepted Answer

The correct answer is A because the weight of the bold arc is the smallest among all the arcs that connect to the connected nodes.

-In Figure 3a, Bold Arc and All Nodes Attached to It