最小生成树Prim算法

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

#define MAX 32767
#define SIZE 100
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0

typedef int Status ;
typedef char VertexType ;

typedef struct
{
int vex ;
int weight ;
ArcNode *next ;
}ArcNode;

typedef struct
{
VertexType data ;
ArcNode *first ;
}VList[SIZE] ;

typedef struct
{
VList vertices ;
int vernum , arcnum ;
}ALGraph ;

ALGraph *G = (ALGraph *)malloc(n * sizeof(ALGraph));

int Locate(ALGraph *G , char a )
{
int i = 0 ;
while(i < G->vernum)
{
if(G->vertices[i].data == a)
{
return i ;
}
++i ;
}
return -1 ;
}

//建立邻接表
Status CreateALGraph(ALGraph *G )
{
int i , j , k ;
int w ;
char v1 , v2 ;
ArcNode *p ;

for(i = 0 ; i < G->vernum ; ++i)
{
	scanf_s("%c",&G->vertices[i].data, sizeof(char));
	G->vertices[i].first = NULL ;
}

for(k = 0 ; k< G->arcnum ; ++k)
{
	scanf_s("%c%c%d", &v1 ,sizeof(char) , &v2, sizeof(char) , &w , sizeof(int)) ;
	i = Locate(G , v1) ;
	j = Locate(G , v2) ;

	p = (ArcNode *)malloc(sizeof(ArcNode)) ;
	p->next = G->vertices[i].first ;
	G->vertices[i].first = p ;

	p = (ArcNode *)malloc(sizeof(ArcNode)) ;
	p->next = G->vertices[j].first ;
	G->vertices[j].first = p ;
}
return OK ;

}

void visit(ALGraph *G , int i )
{
printf("%c",G->vertices[i].data) ;
}

int *visited = (int *)calloc(G->vernum , sizeof(int)) ;//标记顶点是否被访问过

ALGraph *MG ;

//从访问过的顶点中找最小权值边
Status Prim(ALGraph *G , int k )//邻接表(连通图)
{
int i , j ;
ArcNode *p , *p1 ;
int min = MAX;
int v1 , v2 ;//记录构成边的两个点
//构建最小生成树
MG->vernum = G->vernum ;
MG->arcnum = G->arcnum-1 ;
for(i = 0 ; i < G->vernum ; ++i )
{
MG->vertices[i].data = G->vertices[i].data ;
MG->vertices[i].first = NULL ;
}

visited[k] = 1 ;//访问最开始的第一个点
for(i = 0 ; i < G->vernum-1 ; ++i)//找到剩余的边（即n-1条边）
{
	min = MAX ;
	for(j = 0 ; j < G->vernum ;++j)//遍历所有已经访问过的顶点，找到下一条最小权值的边
	{
		if(visited[j] == 1)
		{
			p = G->vertices[j].first ;
			while(p)//找到最小权值的边
			{
				if(min > p->weight && visited[p->vex] == 0)
				{
					min = p->weight ;
					v1 = j ;
					v2 = p->vex ;
				}
				p = p->next ;
			}
		}
	}
	p1 = (ArcNode*)malloc(sizeof(ArcNode)) ;//构建边
	p1->vex = v2 ;
	p1->weight = min ;
	p1->next = MG->vertices[v1].first ;
	MG->vertices[v1].first = p1 ;
	visited[v2] = 1;
}

}