Question: Consider the undirected complete graph having the following cost matrix: 12345 6 1 X 39 8 75 1 6 X 98 x10 6 5 77
Consider the undirected complete graph having the following cost matrix: 12345 6 1 X 39 8 75 1 6 X 98 x10 6 5 77 8 10 X 5 7 11 49 1) a) Perform Prim's Minimun Spanning Tree algorithm starting from node 1. Give the order in which nodes 2...6 are included in the tree solution. b) Give the cost of the Prim solution. c) "Starting Prim's algorithm from a different node may result in a solution having a different cost." True or False? Why? d) The largest cost link in a connected graph can never be in the Minimum Spanning Tree." True or False? Why
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
