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

Linear programming, how i do project in linear programming in agriculture

how i do project in linear programming in agriculture

Vectors - calculus, Vectors  This is a quite short section. We will b...

Vectors  This is a quite short section. We will be taking a concise look at vectors and a few of their properties. We will require some of this material in the other section a

Find out the volume of the solid -y = (x -1) ( x - 3)2, Find out the volume...

Find out the volume of the solid obtained by rotating the region bounded by y = (x -1) ( x - 3) 2 and the x-axis about the y-axis. Solution Let's first graph the bounded r

Problem solver, a bathroom measure 250 cm by 175 cm calculate the side of t...

a bathroom measure 250 cm by 175 cm calculate the side of the largest square tile that can tile the floor

Two even digits , Find the number of six-digit positive integers that can b...

Find the number of six-digit positive integers that can be formed using the digits 1,2, 3, 4, and 5 (every of which may be repeated) if the number must start with two even digits o

Definition of concavity, Definition 1: Given the function f (x ) then 1...

Definition 1: Given the function f (x ) then 1. f ( x ) is concave up in an interval I if all tangents to the curve on I are below the graph of f ( x ) . 2. f ( x ) is conca

Pre-calculas, find the polar coordinates of each point with the given recta...

find the polar coordinates of each point with the given rectangular coordinates. (-(squareroot(3)),3

Geometry, Given: ??????? is supp. to ??????? ???? ????? bisects ??????? ?...

Given: ??????? is supp. to ??????? ???? ????? bisects ??????? ???? ????? bisects ??????? Prove: ??????? is a rt. ?

Multiple integrals, how to convert double integral into polar coordinates a...

how to convert double integral into polar coordinates and change the limits of integration

Series solution, Find the series solution of2x2y”+xy’+(x2-3)Y=0 about regul...

Find the series solution of2x2y”+xy’+(x2-3)Y=0 about regular singular point

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