Two well-known algorithms, Prim's algorithm and ____'s algorithm, can be used to find a minimal spanning tree of a graph.
A) Euler
B) Dekart
C) Kruskal
D) Dijkstra

Question

Quizplus · Accepted Answer

Kruskal's algorithm is well-known for finding a minimal spanning tree, while Prim's algorithm is used for finding a minimum-weighted spanning tree, which may not be minimal. Therefore, Kruskal's algorithm is the best choice for finding a minimal spanning tree.

Two Well-Known Algorithms, Prim's Algorithm and ____'S Algorithm, Can Be