Virtual University administration has planed to make virtual campuses in different cities of Pakistan and wants to communicate with them with each other via communication channel the project is first for eight cities Lahore , Faisalabad, Multan , Islamabad, Abbotabad, Karachi . These cities are named 1, 2, 3………6; respectively. And any pair of two campuses is linked through VU special communication channel Cost to develop this link has been given in following table.

Campus Cost in Million Rupees
1-2 1.05
1-3 1.25
1-4 1.5
1-5 2.0
1-6 2.5
2-3 2.0
2-4 2.02
2-5 2.002
2-6 2.4
3-4 3.5
3-5 1.0
3-6 1.02
4-5 0.5
4-6 0.6
5-6 5.25

Which communication channels will be developed to ensure that all campuses are connected so that the total cost of the project is minimized?

This post has been edited by simsim00: 16 Jun, 2009 - 11:34 AM

Just do Dijkstra's algorithm on it. If you are in algorithm class there's no reason why you shouldnt be able to do this yourself.

typical graph problem

For correctness: I actually meant Kruskal's or Prim's Algorithm...

Seems like the thread maker is long gone anyhow.

Thanks. But i have solved it and my solution has been declared as best among all my friends.

can't give it here cuz it's was my graded assignment.

This post has been edited by simsim00: 19 Jun, 2009 - 07:03 AM

If you can't hold discussions on here, then don't post conversation starting posts. We will not do your homework for you. You are either a part of the community, or you are not, & in my opinion after reading over your posts, you are not here to make discussion, only to post your homework questions, & gather our opinions.