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.
1) Let the Sample Space S = {1, 2, 3, 4, 5, 6, 7, 8}. Suppose each outcome is equally likely. Compute the probability of event E = "an even number is selected". P(E) = 2) A s
how long is the radius of car tyre?
Sketch the graph of the below function. f ( x ) = - x 5 + (5/2 )x 4 + (40/3) x 3 + 5 Solution : Whenever we sketch a graph it's good to have a few points on the graph to
Linear Equations - Resolving and identifying linear first order differential equations. Separable Equations - Resolving and identifying separable first order differential
Skewness - It is a concept which is normally used in statistical decision making. This refers to the degree whether a described frequency curve is deviating away from the gene
students dont retain the topic, hoe to make it easier?
The last topic that we want to discuss in this section is that of intercepts. Notice that the graph in the above instance crosses the x-axis in two places & the y-axis in one plac
inverse rule of x3-5
how to describe the locus of the equation x^2+6xy+y^2+z^2=1 in cylindrical polar coordinates?
how does sin of x equal negative 1/3
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