We want to connect n cities using communication links. For I notequalto j, the c
ID: 3803669 • Letter: W
Question
We want to connect n cities using communication links. For I notequalto j, the cost of a link between cities i and j is C_ij. We want enough links so that the resulting graph is connected, that is so that any two cities are connected by a path of links. We use the following algorithm to do this. First, connect two cities using the cheapest of the (n 2) possible links. Then, successively, add the cheapest link that will connect an unlinked city to a linked city. Stop when the graph is connected - this requires a total of n - 1 links. Suppose the C_ij are independent exponential random variables with mean 1, Find the expected total cost if n = 3 n = 4 find a formula for the expected value, for general n.Explanation / Answer
#include <iostream.h>
#include <conio.h>
class workers
one : while(1)
cout<<" Choose your choice ";
cout<<"1) Create ";
cout<<"2) Display ";
cout<<"3) Jump to Main Menu ";
cout<<"Enter your choice:-";
cin>>choice;
switch(choice)
{
case {1|one">one : for(count=0,i=0;i<10;i++)
getch();
break;
case three : goto start;
default: cout<<" Enter selection is invalid try again ";
}
}
case two : while(1)
cout<<" Choose your choice ";
cout<<"1) Create ";
cout<<"2) Display ";
cout<<"3) Jump to Main Menu ";
cout<<"Enter your choice:-";
cin>>choice;
switch(choice)
{
case {1|one">one : for(count=0,i=0;i<10;i++)
getch();
break;
case three : goto start;
default: cout<<" Invalid choice try again ";
}
}
case three : while(1)
cout<<" Choose your choice ";
cout<<"1) Create ";
cout<<"2) Display ";
cout<<"3) Jump to Main Menu ";
cout<<"Enter your choice:-";
cin>>choice;
switch(choice)
{
case {1|one">one : for(count=0,i=0;i<10;i++)
getch();
break;
case three : goto start;
default: cout<<" Invalid choice try again ";
}
}
case four : goto end;
}
}
end:
}
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.