Question: Which algorithm is used for finding the minimum spanning tree of a graph?A ) Dijkstra's AlgorithmB ) Kruskal's AlgorithmC ) Floyd - Warshall AlgorithmD )
Which algorithm is used for finding the minimum spanning tree of a graph?A Dijkstra's AlgorithmB Kruskal's AlgorithmC FloydWarshall AlgorithmD BellmanFord Algorithm
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
