完成将N随机输入的n个结点（含x，y坐标）的快速排雷，实现n个结点相连之后路径长度最短。实现的过程中，占用内存小，时间复杂度和空间复杂度小。-Completion of the N random input n nodes (including x, y coordinates) of the rapid clearance, achieved after n nodes connected to the shortest path length. Implementation process,