Prim's Algorithm is a greedy algorithm used to find the minimum spanning tree of a weighted, connected, undirected graph by building the tree one vertex at a time. It starts with an arbitrary vertex and repeatedly adds the cheapest possible connection from the tree to another vertex until all vertices are included, ensuring the total weight is minimized.