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.
The next kind of problem seems as the population problem. Back in the first order modeling section we looked at several population problems. In such problems we noticed a single po
degree of a diffrential equation
A house painter uses the formula, c = $110.50 + $39.50h, where c is the total cost and h is the number of hours he works, to determine how much he charges his customers. How much s
love is a parallelogram where prove that is a rectangle
integrate sin(x) dx
98+3
How many types of ogives?
Can anybody suggest me any example of Set Representation?
Evaluate the log function: Calculate 3log 10 2. Solution: Rule 3. log (A n ) = nlog b A 3log 10 2 = log 10 (2 3 ) = log 10 8 = 0.903
Suppose A and B be two non-empty sets then every subset of A Χ B describes a relation from A to B and each relation from A to B is subset of AΧB. Normal 0 fals
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