Prim's Algorithm is a greedy algorithm used to find the Minimum Spanning Tree (MST) of a connected, undirected graph. It was created by Robert C. Prim to find the MST by starting from a single vertex and building the tree by adding the next closest edge until all vertices are included. The graph must be weighted for Prim's Algorithm to be applied.