This method is more effective than Kruskal’s algorithm when a large number of vertices and/or when the distances are listed in tabular form rather than shown on a graph. Since all vertices will be on the minimum connected route, it does not matter which vertex you choose as a starting point, so make an arbitrary choice, calling it P₁ say. Now choose a point with the shortest edge connecting it to P₁ and call it P₂. At each stage add the edge and new point P_i which adds the shortest distance to the total and does not create any loops. Once P_n has been reached, the minimum connected path has been identified.