Although it requires more complicated data structures Prim-05649

Although it requires more complicated data structures, Prim's algorithm for a minimum spanning tree is better than Kruskal's when the graph has a large number of vertices.

This multiple choice question (MCQ) is related to the book/course vu cs502 Fundamentals of Algorithms. It can also be found in vu cs502 Final Term - Quiz No.1.