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

Series is converges or diverges - limit comparison test, Determine if the f...

Determine if the following series converges or diverges by using limit comparison test. Solution To make use of the limit comparison test we require to find out a seco

Fractions, what is equizilent to 2/5

what is equizilent to 2/5

Title expressions equivalent, 2x40 420x4 7x240 84x20 Explain h...

2x40 420x4 7x240 84x20 Explain how three expressions are equivalent.

PROBLEM SOLVING, The perimeter of a rectangular swimming pool is 60m. The l...

The perimeter of a rectangular swimming pool is 60m. The length of the pool is 4 m more than the width. What is the width of the pool?

Math on a spot, compare: 643,251: 633,512: 633,893. The answer is 633,512.

compare: 643,251: 633,512: 633,893. The answer is 633,512.

Word or term for, An irregular perimeter to the circumference of a circle s...

An irregular perimeter to the circumference of a circle such as a protrusion

Iit-jee questions, can u tell me a website for iit-jee questions?

can u tell me a website for iit-jee questions?

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