primtest.c

来自「《数据结构-使用C语言》第三版」· C语言 代码 · 共 29 行

#include<stdio.h>
#include<stdlib.h>
#include<malloc.h>

typedef char DataType;
typedef char VerT;
#define MaxSize 100
#define MaxVertices 10
#define MaxWeight 10000

#include"AdjMGraph.h"
#include"Prim.h"

int main()
{
	AdjMGraph g;
	char a[]={'A','B','C','D','E','F','G','H'};
	RowColWeight row[]={{0,1,10},{0,4,20},{1,3,30},{2,1,40},{3,2,50},{0,5,30},{1,6,35},{4,7,23}};
	int n=8, e=8, i;
	MinSpanTree closeVertex[8];
	
	CreatGraph(&g, a, n, row, e);
	Prim(g, closeVertex);
	printf("初始节点为 %c\n",closeVertex[0].vertex);
	for(i=1;i<n;i++)
	printf("节点 = %c  边的权值 = %d\n",closeVertex[i].vertex, closeVertex[i].weight);
	getchar();
}