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

Tristansmath, how do i multiply demencinals

how do i multiply demencinals

Marketing research, project assignment of page no.19 question no.2

project assignment of page no.19 question no.2

Theory of equations, If p,q,r are roots of x^3-3x^2+4x-7=0 (p+2)(q+2)(...

If p,q,r are roots of x^3-3x^2+4x-7=0 (p+2)(q+2)(r+2)=

Solve the linear programming problem using simple method, Solve the followi...

Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x 1 + 2X 2 Subject to the constraints:                  X 1 + X 2 ≤ 4

Chi square distribution, Chi Square Distribution Chi square was first ...

Chi Square Distribution Chi square was first utilized by Karl Pearson in 1900. It is denoted by the Greek letter χ 2 . This contains only one parameter, called the number of d

Complex Numbers, How do you compute the phase/angle of a complex number? i....

How do you compute the phase/angle of a complex number? i.e 1+2i

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