Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Prove that Prim's algorithm produces a minimum spanning tree of a connected weighted graph.
Ans: Suppose G be a connected, weighted graph. At each iteration of Prim's algorithm, an edge should be found that connects a vertex in a subgraph to a vertex outside the subgraph. As G is connected, there will all time be a path to each vertex. The output T of Prim's algorithm is a tree, as the edge and vertex added to T are connected. Suppose T1 be a minimum spanning tree of G. If T1=T then T is a minimum spanning tree. If not, let e be the first edge added throughout the construction of T that is not in T1, and V be the set of vertices connected by the edges added previous to e. After that one endpoint of e is in V and the other is not. As T1 is a spanning tree of G, there is a path in T1 joining the two endpoints. As one travels along with the path, one should encounter an edge f joining a vertex in V to one that is not in V. Now here, at the iteration while e was added to T, f could as well have been added and it would be added in place of e if its weight was less than e. As f was not added, we conclude that w(f) ≥ w(e).
Suppose T2 be the graph acquired by removing f and adding e from T1. It is simple to show that T2 is connected, has similar number of edges as T1, and the total weights of its edges is not larger as compared to that of T1, therefore it is as well a minimum spanning tree of G and it consists of e and all the edges added before it throughout the construction of V. Repeat the steps above and we will eventually acquired a minimum spanning tree of G that is similar to T. This depicts T is a minimum spanning tree.
How do you calculate for the distance between two co-ordinates?
Rounding whole numbers List the order in which nancy, amy, ethel and cindy line up in single file to board the school bus. Then match the girls with their heights, which are fo
A large pipe dispenses 750 gallons of water in 50 seconds. At this rate, how long will it take to dispense 330 gallons? Find out the number of gallons per second by dividing 75
PAIR OF LINEAR EQUATIONS IN TWO VARIABLES: Like the crest of a peacock so is mathematics at the head of all knowledge. Example At a certain time in a deer park, t
The amount of particulate matter left in solution during a filtering process is given by the equation p(n) = 500(2) -0.8n , where n is the number of filtering steps. Find the amoun
v=u+at s=ut+1/2at^2
if 500kg of food lasts 40 days for 30 men.how many men will consume 675kg of food in 45 days.
1
Hyperboloid of Two Sheets The equation which is given here is the equation of a hyperboloid of two sheets. - x 2 /a 2 - y 2 / b 2 + z 2 /c 2 = 1 Here is a diagram of
Write a proff given angle MJL congruent with angle KJL
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +1-415-670-9521
Phone: +1-415-670-9521
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd