Write down Prims algorithm and solve the following problem

1

1.9kviews

written 7.3 years ago by

satishmanje93 • 250

modified 2.9 years ago by

binitamayekar ★ 6.7k

Subject: Analysis Of Algorithm

Topic: Greedy Method

Difficulty: High

enter image description here

analysis of algorithms

ADD COMMENT EDIT

1 Answer

0

42views

written 2.9 years ago by

binitamayekar ★ 6.7k

Prim's Algorithm

Step 1 -

Check whether the graph contains any loops and parallel edges or not.
If a graph contains any loops and parallel edges, then remove all loops and parallel edges.

Step 2 -

Randomly choose any vertex, but the vertex connecting to the edge having the least …

and 2 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.