Prime算法纯代码自己做的绝对正确

k = i;
for (j = 1; j < G.VertexNum;j++) //查找权值最小的一个邻接边
if (weight[j] < min && tmpvertex[j] != 0) //找到具有最小权值的未使用边
{
min = weight[j]; //保存权值
k = j; //保存邻接点序号
return 0;
}
OutMatrix(&G);
cout << "生成最小生成树的边：" << endl;
Prim(G); //调用最小生成树函数
cout << "是否继续？" << endl;
cin >> select;
getchar();
} while (select != 'n'&&select != 'N');
}
cout << "请输入构成各边的两个顶点及权值:\n";
for (k = 0; k < G->EdgeNum; k++)
{
cout << "第" << k + 1 << "条边：";
cin >> start >> end >> weight;
for (i = 0; start != G->Vertex[i]; i++); //在已有顶点中查找起始顶点
{
int i, j, k, weight;
char start, end; //边的起点、终点
cout<<"请输入顶点信息："<<endl;
for (i = 0; i < G->VertexNum; i++) //输入顶点
{
cout << "第" << i + 1 << "个顶点：";
cin >> G->Vertex[i];
#include<iostream>
#include<stdio.h>
using namespace std;
#define VERTEX_MAX 26 //图的最大顶点数
#define MAXVALUE 32767 //最大值
typedef struct
{
char Vertex[VERTEX_MAX]; //保存顶点信息
}
}
cout << endl << "最小生成树总权值为：" << sum;
}
int main()
{
MatrixGraph G; //定义保存邻接矩阵的图
int i, j, s, t;
char select;
do
{
cout << "请输入图的顶点数和边数：";
cin >> G.VertexNum >> G.EdgeNum; //输入顶点数和边数
{
int i, j;
for (j = 0; j < G->VertexNum; j++)
printf("\t%c", G->Vertex[j]); //第一行输出顶点信息
cout << endl;
for (i = 0; i < G->VertexNum; i++)
{
cout << G->Vertex[i];
for (i = 0; i < G.VertexNum; i++) //清空矩阵
for (j = 0; j < G.VertexNum; j++)
G.Edges[i][j] = MAXVALUE; //设置矩阵中各元素的值
CreateMatrixGraph(&G); //生成邻接矩阵的图
cout << "邻接矩阵如下：" << endl;
}
sum += min; //累加权值
printf("(%c,%c),", tmpvertex[k], G.Vertex[k]); //输出最小生成树的一条边
tmpvertex[k] = USED; //将编号为k的顶点并入U集
weight[k] = MAXVALUE; //已使用顶点的权值为最大值
char tmpvertex[VERTEX_MAX]; //临时顶点信息
for (i = 1; i < G.VertexNum; i++)
{
weight[i] = G.Edges[0][i];
if (weight[i] == MAXVALUE)
tmpvertex[i] = NOADJ; //非邻接顶点
for (j = 0; j < G->VertexNum; j++)
{
if (G->Edges[i][j] == MAXVALUE) //若权值为最大值
printf("\t00"); //无穷大，暂时用00代替
else
printf("\t%d", G->Edges[i][j]); //输出边的权值
}
else
tmpvertex[i] = G.Vertex[0]; //邻接顶点
}
tmpvertex[0] = USED; //将0号顶点并入U集
weight[0] = MAXVALUE; //设已使用顶点权值为最大值
for (i = 1; i < G.VertexNum; i++)
{
min = weight[0]; //最小权值
for (j = 0; j < G.VertexNum;j++) //重新选择最小边
if(G.Edges[k][j] < weight[j] && tmpvertex[j] != 0)
{
weight[j] = G.Edges[k][j]; //权值
tmpvertex[j] = G.Vertex[k]; //上一个顶点信息
int Edges[VERTEX_MAX][VERTEX_MAX]; //保存边的权
int isTraபைடு நூலகம்[VERTEX_MAX]; //遍历标志
int VertexNum; //顶底数量
int EdgeNum; //边数量
}MatrixGraph;
void CreateMatrixGraph(MatrixGraph *G)
for (j = 0; end != G->Vertex[j]; j++); //在已有顶点中查找终顶点
G->Edges[i][j] = weight; //对应位置保存权值
G->Edges[j][i] = weight; //在对角位置保存权值
}
}
void OutMatrix(MatrixGraph *G)
cout << endl;
}
}
#define USED 0 //已使用，加入U集合
#define NOADJ -1 //非邻接顶点
void Prim(MatrixGraph G) //最小生成树
{
int i, j, k, min, sum = 0;
int weight[VERTEX_MAX]; //权值