Ask
Login
0
1.5kviews
Explain the concept of greedy technique for Prim's algorithm. Obtain minimum cost spanning tree for the graph below Prim's algorithm.
written 2.1 years ago by gravatar for pedsangini276 pedsangini276 • 4.8k modified 2.1 years ago by gravatar for binitamayekar binitamayekar ★ 6.4k

enter image description here Prim's algorithm
data structures and algorithms
ADD COMMENT EDIT
1 Answer
0
78views
written 2.1 years ago by gravatar for binitamayekar binitamayekar ★ 6.4k

Prim’s Algorithm

  • Prim's Algorithm is a greedy approach that is used to find the Minimum Spanning Tree (MST) from a graph.

  • To apply Prim’s algorithm, the given graph must be weighted, connected, and undirected.

  • Prim's algorithm finds the subset of edges that includes every vertex of the graph such that …

Create a free account to keep reading this post.

and 4 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.