Ask
Login
1
15kviews
Compare Prims and Kruskals method for finding Minimum spanning Tree find MST for following using prims method.
written 7.2 years ago by gravatar for teamques10 teamques10 ★ 65k •   modified 4.1 years ago
analysis of algorithms
ADD COMMENT EDIT
1 Answer
3
80views
written 7.2 years ago by gravatar for teamques10 teamques10 ★ 65k

enter image description here

Ans:

Prims Kruskal’s
This algorithm is for obtaining minimum spanning tree by selecting the adjacent vertices of already selected vertices. This algorithm is for obtaining minimum spanning tree but it is not necessary to choose adjacent vertices of already selected vertices.
Prim’s algorithm initializes with a node Kruskal’s algorithm initiates …

Create a free account to keep reading this post.

and 2 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.