在可能假设的m条管道中，选取n-1条管道，使得既能连通n个小区，又能使总投资最小。每条管道的费用以网中该边的权值形式给出，网的存储采用邻接表的结构。-M may be assumed in the pipeline, the pipeline select n-1, n connectivity makes both plots, but also make a minimum total investment. The cost of each pipeline in the form of network weights given to the edges, network storage using the structure adjacent to the table.