Total weight of minimum spanning tree, Data Structure & Algorithms

a) Run your program for α = 0.05, 0.5, and 0.95. You can use n = 30, and W = 10. What is impact of increasing value of α on connectivity of G'? To answer this question, for each value of α, test the graph for connectivity three times and use those three instances to base your answer.

b) For α = 0.5 and W = 10, how does total weight of MST vary with n? You can show a plot varying n from 10 to 50 in steps of 10 on the x-axis, and plotting MST weight on the y-axis. Why do you think the MST weight pattern is the way it is for increasing n?

Hand In:

Report, with source code attached as appendix. A brief description in your report on your code structure is needed. You could also explain how you are testing connectivity in your code, and what algorithm you are using for creating an MST.

Posted Date: 3/20/2013 2:17:16 AM | Location : United States







Related Discussions:- Total weight of minimum spanning tree, Assignment Help, Ask Question on Total weight of minimum spanning tree, Get Answer, Expert's Help, Total weight of minimum spanning tree Discussions

Write discussion on Total weight of minimum spanning tree
Your posts are moderated
Related Questions
Algorithm for determining strongly connected components of a Graph: Strongly Connected Components (G) where d[u] = discovery time of the vertex u throughout DFS , f[u] = f

Ruby implementation of the Symbol ADT Ruby implementation of the Symbol ADT, as mentioned, hinges on making Symbol class instances immutable that corresponds to the relative la

Explain the theory of computational complexity A  problem's  intractability  remains  the  similar  for  all  principal  models  of   computations    and   all reasonable inpu

Q. Explain the insertion sort with a proper algorithm. What is the complication of insertion sort in the worst case?

Data array A has data series from 1,000,000 to 1 with step size 1, which is in perfect decreasing order. Data array B has data series from 1 to 1,000,000, which is in random order.


how to write a pseudo code using Kramer''s rule

what is multilist length file organisation? explain with an example

Using Assertions When writing code, programmer must state pre- and subtle post conditions for public operations, state class invariants and insert unreachable code assertions a

The Euclidean algorithm is an algorithm to decide the greatest common divisor of two positive integers. The greatest common divisor of N and M, in short GCD(M,N), is the largest in