Prime算法生成最小生成树

虽说是生成树，但我只将生成的边输出了。至于怎么用这些边来创建树。。。我不知道_(:з」∠)_

 //Prime方法生成最小生成树
 void GraphAdjacencyListWeight::GenerateMSCPPrime(int FirstVertex) {
     int *visited = new int[VertexNumber];
     memset(visited, , VertexNumber * sizeof(int));
     //-1代表没用到
     //0代表此点已放进容器
     CLOSEEDGE *CloseEdge = new CLOSEEDGE[VertexNumber];
     for (int lop = ; lop < VertexNumber; lop++) {
         CloseEdge[lop].Weight = -;
         CloseEdge[lop].StartVer = -;
     }

     CloseEdge[FirstVertex].StartVer = ;
     CloseEdge[FirstVertex].Weight = ;
     //起点放进容器
     visited[FirstVertex] = ;

     //将起点的邻接信息放入CloseEdge
     for (auto tmpPtr = (VectorVertexList[FirstVertex])->firstArc; tmpPtr != nullptr; tmpPtr = tmpPtr->nextArc) {
         CloseEdge[tmpPtr->AdjacencyNode].StartVer = FirstVertex;
         CloseEdge[tmpPtr->AdjacencyNode].Weight = tmpPtr->weight;
     }

     int k = -;
     while (!IsAllVisited(visited)) {
         k = SearchMinWeight(CloseEdge);
         //输出生成的边
         cout << "(" << CloseEdge[k].StartVer << " , " << VectorVertexList[k]->VertexIndex << ")" << endl;
         visited[k] = ;

         UpdateCloseEdge(CloseEdge, k);
     }

     //销毁
     delete[]visited;
     delete[]CloseEdge;
 }

Prime

 int GraphAdjacencyListWeight::SearchMinWeight(CLOSEEDGE closeedge[]) {
     int miniWeight = -;
     int index = -;
     for (int lop = ; lop < VertexNumber; lop++) {
         if ((miniWeight > closeedge[lop].Weight || miniWeight == -) && closeedge[lop].Weight > ) {
             miniWeight = closeedge[lop].Weight;
             index = lop;
         }
     }
     if (index == -) {
         //返回 -1 说明所有点都取了
         return -;
     }
     return index;
 }

 void GraphAdjacencyListWeight::UpdateCloseEdge(CLOSEEDGE CE[], int k) {
     //k点已被收录
     CE[k].Weight = ;
     CE[k].StartVer = ;

     for (auto tmpPtr = VectorVertexList[k]->firstArc; tmpPtr != nullptr; tmpPtr = tmpPtr->nextArc) {
         //已是最小生成树的成员,不进行比较
         if (CE[tmpPtr->AdjacencyNode].Weight == ) {
             continue;
         }
         if (CE[tmpPtr->AdjacencyNode].Weight >= tmpPtr->weight || CE[tmpPtr->AdjacencyNode].Weight == -) {
             CE[tmpPtr->AdjacencyNode].StartVer = k;
             CE[tmpPtr->AdjacencyNode].Weight = tmpPtr->weight;
         }
     }
 }

Related Functions

运行结果:

参照书本的174页的那个图