普里姆算法(Prim’s algorithm),图论中的一种算法,可在加权连通图里搜索最小生成树。意即由此算法搜索到的边子集所构成的树中,不但包括了连通图里的所有顶点,且其所有边的权值之和亦为最小
void MiniSpanTree_Prim(Graph graph) {
int* lowcost = new int[graph.arcNum];
int* adjvex = new int[graph.vertexNum];
adjvex[0] = 0;//将0结点加入adjvex
lowcost[0] = 0;
//初始化lowcost
for (int i = 0; i < graph.vertexNum; i++) {
lowcost[i] = graph.arc[0][i];
// adjvex[i] = 0;
}
for (int i = 1; i < graph.vertexNum; i++)
{
int min = Max;
int j = 1,node = 0;
//寻找最小的lowcost
while (j < graph.vertexNum){//!=保证这个结点未被选过
if (lowcost[j] != 0 && lowcost[j] < min) {
min = lowcost[j];
node = j;
}
j++;
}
cout << "当前最小边:" << lowcost[node]<<"新加结点:"<<node<<endl;
lowcost[node] = 0;//因为此结点被选中,所以到结点node的最短距离就变为了0
adjvex[node] = 0;
//更新lowcost
for (