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.
online Exam
A leap year has 366 days, therefore 52 weeks i.e. 52 Sunday and 2 days. The remaining 2 days may be any of the following : (i) Sunday and Monday (ii) Monday and Tuesday (iii)
The scale of a map is 0.5 in 25mi the actual distance between two cities is 725mi write a proportion that represents the relationship how far apart will the cities be on the map
(a) Derive the Marshalian demand functions for the following utility function: u(x 1 ,x 2 ,x 3 ) = x 1 + δ ln(x 2 ) x 1 ≥ 0, x 2 ≥ 0 Does one need to consider the is
finding distance using circumference
A car travels at a rate of (4x2 - 2). What is the distance this car will travel in (3x - 8) hours? Use the formula distance = rate × time. Through substitution, distance = (4x2
Definition : A function f ( x ) is called differentiable at x = a if f ′ ( x ) exists & f ( x ) is called differentiable onto an interval if the derivative present for each of the
what is 2+2=
Consider the following system of linear equations. X 1 +x 3 +x 4 = 2 X 1 +x 2 +x 3 = 6 X 2 +x 3 +x 4 = 3 X 1 +x 2 +x 4 = 0 (a) Write out the augmented matrix fo
break even analysis problem and solutions
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