Prim's algorithm is used to find the Minimum Spanning Tree (MST) of a given weighted graph. MST means that connecting all the nodes of the given graph with the minimum weights of each connection.