选取一定点X0，连接距离其最近的顶点X1，再连接距X1最近的顶点X2，依次类推下去，直到最后目的地。
数学语言：贪心算法，在一给定的无向图G = (V, E) 中，(u, v) 代表连接顶点 u 与顶点 v 的边（即），而 w(u, v) 代表此边的权重，若存在 T 为 E 的子集（即）且为无循环图，使得 w(T) 最小，则此 T 为 G 的最小生成树。(Select a point X0, connect it from its nearest vertex X1, and then connect the nearest vertex X2 from X1, and go on and on until the final destination.
The language of Mathematics: greedy algorithm, graph G = in a given no (V, E), (U, V) on behalf of connected vertex u and vertex v (i.e., w) and edges (U, V) on behalf of the weight of this side, if there is a subset of E (i.e. T) and no cycle diagram makes w (T) is minimum, the T for the minimum spanning tree G.)