Given the following nodes and distances, determine the minimal length of cable necessary to connect all nodes, using Node 2 as the starting point.
A)1200
B)1100
C)900
D)700

Question

Given the following nodes and distances, determine the minimal length of cable necessary to connect all nodes, using Node 2 as the starting point. 
A)1200 
B)1100 
C)900 
D)700

Quizplus · Accepted Answer

To find the minimal length of cable necessary to connect all nodes, we can use the Prim's algorithm or Kruskal's algorithm. However, since Node 2 is the starting point, we can simplify the process by simply selecting the edges that connect directly from Node 2 to the other nodes in increasing order of distance. This yields the following sequence:

Node 2 - Node 1 (distance of 100)
Node 2 - Node 3 (distance of 200)
Node 2 - Node 4 (distance of 300)
Node 4 - Node 5 (distance of 200)
Node 5 - Node 6 (distance of 200)
Node 6 - Node 7 (distance of 100)

Adding up these distances, we get a minimal length of 1100, which corresponds to answer choice B.

Given the Following Nodes and Distances, Determine the Minimal Length