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.
using the g.e matrix, how can you turn an unattractive product to be attractive
Paulina played 3 soccer games on Saturday she drank I juice box during each soccer game how many juice boxes did she drank
The Ravens played 25 home games this year. They had 9 losses and 2 ties. How many games did they win? Eleven games are accounted for along with the losses and ties (9 + 2 = 11)
Write following in terms of simpler logarithms. (a) log 3 (9 x 4 / √y) Solution log 3 (9 x 4 / √y) =log 3 9x 4 - log y (1/2) =log 3 9 + log 3 x 4
Grouping - situations in which we need to find the number of portions of a given size which can be obtained from a given quantity. (e.g., if there are 50 children in a class and t
Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4
I've termed this section as Intervals of Validity since all of the illustrations will involve them. Though, there is many more to this section. We will notice a couple of theorems
the automatic hopper loader is set to put 36 tons of coal in each car. the actual weights of coal loaded into each car arw normally distributed with a mean of 36 tons and a standar
Center and Radius 1)(x+2)^2-(y-3)^2=4
write down all the factors of 36
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: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd