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.
Linda bought 35 yards of fencing at $4.88 a yard. How much did she spend? To multiply decimals, multiply generally, count the number of decimal places in the problem, then us
compare: 643,251: 633,512: 633,893. The answer is 633,512.
1. Suppose the arrival times of phone calls in a help centre follow a Poisson process with rate 20 per hour (so the inter-arrival times are independent exponential random variables
A palm tree of heights 25m is broken by storm in such a way that its top touches the ground at a distance of 5m from its root,but is not separated from the tree.Find the height at
Jeff burns 500 calories per hour bicycling. How long will he have to ride to burn 750 calories? To find out the number of hours required to burn 750 calories, divide 750 throug
Division basically refers to multiplication of reciprocal. For example a/b is same as a*1/b or we can say, is same as a*b -1 , which is "a" multiplied to the inverse of "b". There
suppose you a business owner and selling cloth. the following represents the number of items sold and the cost for each item. use matrix operation to determine the total revenue ov
Decision making under uncertainty Various methods are used to make decision in circumstances whereas only the pay offs are identified and the likelihood of every state of natur
how to convert double integral into polar coordinates and change the limits of integration
The population of Hamden was 350,000 in 1990. By 2000, the population had decreased to 329,000. What percent of decrease is this? First, ?nd out the number of residents who lef
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