Which algorithm for finding the Minimum Spanning Tree (MST) grows the tree one vertex at a time from an arbitrary starting root?
Show answer
Prim's algorithm
Prim's algorithm is a greedy algorithm that always adds the lightest edge connecting a vertex in the current tree to a vertex outside the tree. It is typically implemented using a priority queue to find the minimum weight edge.
Also asked as:
- Which MST algorithm starts from an arbitrary root and expands the tree one vertex at a time?