What problem does Prims algorithm solve?

Prim's algorithm finds the minimal spanning tree of a weighted graph. That is, it finds a tree, covering all vertices, such that the sum of all edge weights is at a minimum.