Prove that prims algorithm produces a minimum spanning tree, Mathematics

Assignment Help:

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.

 


Related Discussions:- Prove that prims algorithm produces a minimum spanning tree

Logarithms, We know that 2 4 = 16 and also that 2 is referred to as ...

We know that 2 4 = 16 and also that 2 is referred to as the base, 4 as the index or power or the exponent. The same if expressed in terms of logarithms would be log 2

Development is continuously going on-- learning mathematics, DEVELOPMENT IS...

DEVELOPMENT IS CONTINUOUSLY GOING ON :  Think of any two children around you. Would you say that they are alike? Do they learn the same things the same way? It is very unlikely be

Stat, defination of uper boundarie .

defination of uper boundarie .

John and charlie have a whole of 80 dollars he has x dollar, John and Charl...

John and Charlie have a whole of 80 dollars. John has x dollars. How much money does Charlie have? This problem translates to the expression 42 + (11 - 9) ÷ 2. Using order of o

Determine the actual viewing area, Computer monitors are calculated by thei...

Computer monitors are calculated by their diagonals. If a monitor is advertised to be 19 in, Determine the actual viewing area, considerthe screen is square? (Round to the nearest

Calculus, need someone to log into my hawkes and complete homework due

need someone to log into my hawkes and complete homework due

Factoring quadratic polynomials, Primary, note that quadratic is another te...

Primary, note that quadratic is another term for second degree polynomial. Thus we know that the largest exponent into a quadratic polynomial will be a2. In these problems we will

Sketch the graph of the derivative of this function f '( x), Below is the s...

Below is the sketch of a function f ( x ) . Sketch the graph of the derivative of this function f ′ ( x ) . Solution : At first glance it seems to an all however impossib

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

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!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd