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
Define Dynamic Programming  Dynamic  programming  is  a  method  for  solving  problems  with  overlapping  problems.  Typically, these sub problems arise from a recurrence rel

Following are some of the drawback of sequential file organisation: Updates are not simply accommodated. By definition, random access is impossible. All records should be

State the ways to construct container taxonomy There are several ways that we could construct our container taxonomy from here; one way that works well is to make a fundamental

Example: Assume the following of code: x = 4y + 3 z = z + 1 p = 1 As we have been seen, x, y, z and p are all scalar variables & the running time is constant irrespective

what is tree

Q. Write down an algorithm to test whether a Binary Tree is a Binary Search Tree.              A n s . The algorithm to check whether a Binary tree is as Binary Search

Merge sort is also one of the 'divide & conquer' classes of algorithms. The fundamental idea in it is to split the list in a number of sublists, sort each of these sublists & merge

Two broad classes of collision resolution techniques are A) open addressing and B) chaining


The following are several operations on a AA-tree: 1. Searching: Searching is done using an algorithm which is similar to the search algorithm of a binary search tree. 2. Ins