To find the minimum spanning tree using Prim's algorithm, start with an arbitrary vertex and add it to the set of visited vertices. Then, iteratively add the edge with the smallest weight that connects a visited vertex to an unvisited vertex, updating the set of visited vertices. Repeat this process until all vertices are visited, resulting in the minimum spanning tree.