The minimal spanning tree algorithm has connected nodes 8 and 9. Node 8 could be connected to nodes 11 (distance 6) and 12 (distance 5) and node 9 could be connected to node 12 (distance 3) and node 13 (distance 2). Which will you do next?
A) connect 8 to 11
B) connect 8 to 12
C) connect 9 to 12
D) connect 9 to 13

Question

Quizplus · Accepted Answer

In a minimal spanning tree, the goal is to connect all nodes with the minimal total edge weight. The next step is to choose the edge with the smallest weight that doesn't form a cycle. Among the given options, connecting node 9 to node 13 has the smallest distance (2).

The Minimal Spanning Tree Algorithm Has Connected Nodes 8 and 9