and 2 others joined a min ago.
1
16kviews
Compare Prims and Kruskals method for finding Minimum spanning Tree find MST for following using prims method.
1 Answer
3
85views
written 8.8 years ago by
teamques10
★ 70k
|
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 … |
and 4 others joined a min ago.
ADD COMMENT
EDIT
Please log in to add an answer.