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

Factors, Question Suppose that f(x) has (x - 2) 2 and (x + 1) as its on...

Question Suppose that f(x) has (x - 2) 2 and (x + 1) as its only factors. Sketch the graph of f. State all the zeros of f.

Marketing management , #How are Indian customers visiting Shoppers’ Stop an...

#How are Indian customers visiting Shoppers’ Stop any different from customers of developed western countries?

Show that of all right triangles inscribed in a circle, Show that of all ri...

Show that of all right triangles inscribed in a circle, the triangle with maximum perimeter is isosceles.

6thgrade, do you have 3 digit and 4 digit number problem

do you have 3 digit and 4 digit number problem

Counters and registers, design a synchronous, recycling, MOD-12 counter wit...

design a synchronous, recycling, MOD-12 counter with D FF''s. Use the states 0000 through 1011 in the counter.

Discount, outdoor grill- regular price:$360 discount:33 1/3%

outdoor grill- regular price:$360 discount:33 1/3%

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