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
Question 1 Write a program in 'C' to read N numbers and print them in descending order Question 2 Discuss the properties of ADT Question 3 Write a note on

How sparse matrix stored in the memory of a computer?

Explain the array and linked list implementation of stack

Define the External Path Length The External Path Length E of an extended binary tree is explained as the sum of the lengths of the paths - taken over all external nodes- from

two standards ways of traversing a graph in data structure

Question 1 Write the different characteristics of an algorithm Question 2 Explain in brief the asymptotic notations Question 3 Write an algorithm of insertion sort and e

Implement a linear-expected-time algorithm for selecting the k th smallest element Algorithm description 1. If |S| = 1, then k = 1 and return the element in S as the an

Comp are two functions n 2    and  2 n  / 4  for distinct values of n.   Determine When s ec on d function b ec om es l a r g er th an f i r st functi

What is a first-in-first-out data structure ? Write algorithms to perform the following operations on it – create, insertion, deletion, for testing overflow and empty conditions.

Write an algorithm to print all even numbers in descending order and draw the flowchart