| 释义 |
Prim's algorithm (to solve the minimum connector problem) 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 P1 say. Now choose a point with the shortest edge connecting it to P1 and call it P2. At each stage add the edge and new point Pi which adds the shortest distance to the total and does not create any loops. Once Pn has been reached, the minimum connected path has been identified.
|