QUESTION A video conference is to take place in the network shown in Figure 1 To transport the communication efficiently through this network we need a minimum spanning tree network which connects...

1 answer below »
this assignment is from University of Southern Queensland.


QUESTION A video conference is to take place in the network shown in Figure  1 To transport the communication efficiently through this network we need a minimum spanning tree network which connects these nodes through the existing links. Find such a minimum spanning tree, i.e. a network with the minimum total length which connects all these nodes. Make sure to explain all your reasoning, including a selection of steps of your algorithm which make it clear that you have carried it out systematically. The solution for the minimum spanning tree problem that you have found should be given and it should achieve the minimum possible total cost (ie the sum of link costs for this network is the minimum possible). Is the minimum spanning tree that you found unique? Give your reasons. Figure 1 CRITERIA 1. The minimum spanning tree algorithm has been carried out on the network of Figure 1 and sufficiently many steps shown to confirm that it has been done correctly. 2. Your solution has been stated clearly and it has the minimum possible cost. 3. Whether this solution is minimum in cost is correctly identified.
Answered Same DayOct 14, 2021

Answer To: QUESTION A video conference is to take place in the network shown in Figure 1 To transport the...

Riya answered on Oct 14 2021
153 Votes
To find a minimum spanning tree with minimum total cost start with storing the value of cost needed to go from one node to another in 2 –D array .Three arrays are needed to find the minimum cost . The parent array which will help to store the parent node of each node. Keyval array to store the value of each node and the mstset array to see if every node is included in MST or not. It’s a convention to make node 0 as the source node so, in this example we will make node A as the source node . Then find the node which can be reached with minimum possible cost and mark it as visited in the mstset array . Update the parent array and the neighboring nodes values accordingly.
The total cost to reach all the nodes in this problem is 32. It can be computed from the following program.
// C++ code to find out minimum cost
// path to connect all the cities
#include
using namespace std;
// Function to find out minimum valued node
// among the nodes which are not yet included in MST
int minnode(int n, int keyval[], bool mstset[]) {
int mini =...
SOLUTION.PDF

Answer To This Question Is Available To Download

Related Questions & Answers

More Questions »

Submit New Assignment

Copy and Paste Your Assignment Here