Apply prim’s algorithm and kruskal’s algorithm method to find the minimum cost spanning tree to graph shown below.
Answer:-
Algorithm: Prims
Algorithm: Krushkal’s
Problem: Prim’s
Problem: Kruskal’s
Apply Prim’s algorithm and Kruskal’s algorithm to find the minimum cost-spanning tree in the graph below.