Using Prim's algorithm, determine minimum cost spanning tree for the weighted graph shown below, fig. Q3(b):

Welcome back.

and 5 others joined a min ago.

3.3kviews

written 2.1 years ago by

pedsangini276 • 4.8k

modified 2.1 years ago by

binitamayekar ★ 6.4k

Prim's algorithm enter image description here

ADD COMMENT EDIT

1 Answer

219views

written 2.1 years ago by

binitamayekar ★ 6.4k

• modified 2.1 years ago

Prim's Algorithm is a greedy approach that is used to find the Minimum Spanning Tree (MST) from a graph.
Let's find out the minimum cost spanning tree for the given graph using Prim's Algorithm.
In the given graph there are no loops and parallel edges are present.
Therefore, …

and 2 others joined a min ago.

ADD COMMENT EDIT

Community

Content

Company