校园导游图的课程设计(三)

void Prim( ListMatrix *G, int start )
/*
 * 寻找一某一点为核心的最佳布线
 * 即使用prime最小生成树
 */
 {
         struct{
                 int adjvex;
                 int lowcost;
         }closedge[NUMMAX];

         int i,j,k,m,min;
         ArcNode * p;

         closedge[start].lowcost = 0;

         for( i=1; i<=G->vexnum; i++ )
         {
                 if( i != start )
                 {
                         closedge[i].adjvex = start;
                         closedge[i].lowcost = INFNITY;
                 }
         }//初始化，无穷大
         
         p = G->vertex[start].next;
         while( p != NULL )
         {
                 closedge[p->adjvex].lowcost = p->weight;
                 p = p->next;
         }//复制

         for( j=1; j<=G->vexnum; j++ )
         {
                 min = INFNITY;
                 for( k=1; k<=G->vexnum; k++ )
                 {
                          if( closedge[k].lowcost!=0 && closedge[k].lowcost < min )
                         {
                              m = k;
                              min = closedge[k].lowcost;
                         }
                 }//挑选最小的

                 closedge[m].lowcost = 0;

                 p = G->vertex[m].next;

                 while( p != NULL )
                 {
                         if( p->weight < closedge[p->adjvex].lowcost )
                         {
                                 closedge[p->adjvex].lowcost = p->weight;
                                 closedge[p->adjvex].adjvex = m;
                         }
                         p = p->next;
                 }//while 找到变短的
         }
                       printf("\t\t\t\t\t\t\t布线方式:\n");
         for( i=1; i<=G->vexnum; i++ )
         {
                 if( i!= start)
                 {
                       printf("\t\t\t\t\t\t\t%d 从%d:%s 到 %d:%s\n ",i,closedge[i].adjvex,
                                 NumtoName(G,closedge[i].adjvex),i,NumtoName(G,i));
                        
                 }
         }

 }