Write prim's algorithm, Mathematics

Assignment Help:

Write Prim's Algorithm.  

Ans: Prim's algorithm to find out a minimum spanning tree from a weighted graph in step by step form is given below. 

Let G = (V, E) be graph and S = (VS, ES) be the spanning tree to be found from G.

Step 1: Choose a vertex v1 of V and initialize 

VS = {v1} and

ES

= {}

Step 2: Choose a nearest neighbor of vi from V that is adjacent to some vj∈VS and that edge (vi, vj) does not form a cycle with members edge of ES. Set

VS = VS ∪{vi} and

ES = ES ∪{(vi, vj)}  

Step 3: Again Repeat step2 until |Es| = |V| - 1.


Related Discussions:- Write prim's algorithm

Tangents, find a common tangent to two circles

find a common tangent to two circles

Hcf, the length of three pieces of ropes are 140cm,150cm and 200cm.what is ...

the length of three pieces of ropes are 140cm,150cm and 200cm.what is the greatest possible length to measure the given pieces of a rope?

Trig identities, What is the exact vale of sin(theta/2) when sintheta=3/5, ...

What is the exact vale of sin(theta/2) when sintheta=3/5, pi/2

Statistics, what is the meaning of statistics

what is the meaning of statistics

Dr.., I need some material on Bachet equation

I need some material on Bachet equation

Integrals involving roots - integration techniques, Integrals Involving Roo...

Integrals Involving Roots - Integration Techniques In this part we're going to look at an integration method that can be helpful for some integrals with roots in them. We hav

Probability, the probability that an account officer will pass her exam is ...

the probability that an account officer will pass her exam is 5/9. if she pass,the probability that she will be promoted is 3/4. she is not promoted if she fails her professional e

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