Given the following distances between destination nodes,what is the minimum distance that connects all the nodes?
A)900
B)650
C)400
D)1200
E)None of the above

Question

Given the following distances between destination nodes,what is the minimum distance that connects all the nodes? 
A)900 
B)650 
C)400 
D)1200 
E)None of the above

Quizplus · Accepted Answer

We can use Prim's algorithm to find the minimum distance that connects all the nodes. Starting from any node, we choose the edge with the minimum weight that connects to an unvisited node. We can build a table like this:

| Node | Visited | Nearest Node | Distance |
|------|---------|--------------|----------|
| A    | Yes     |              |          |
| B    | No      | A            | 200      |
| C    | No      | A            | 300      |
| D    | No      | B            | 150      |
| E    | No      | D            | 200      |

At each step, we choose the node with the smallest distance and mark it as visited. We then update the table by checking if any unvisited nodes can be reached with a smaller distance through the newly visited node. The minimum distance that connects all the nodes is the sum of all the distances in the table, which is 650 (200+300+150+200). Therefore, the answer is B.

Given the Following Distances Between Destination Nodes,what Is the Minimum