数据结构：最小连通网-Prime算法

Prime算法：



C语言实现如下：

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

/* run this program using the console pauser or add your own getch, system("pause") or input loop */

#define VNUM 9
#define MV 65536

int P[VNUM];
int Cost[VNUM];
int Mark[VNUM];
int Matrix[VNUM][VNUM] = 
{
	{0, 10, MV, MV, MV, 11, MV, MV, MV},
    {10, 0, 18, MV, MV, MV, 16, MV, 12},
    {MV, 18, 0, 22, MV, MV, MV, MV, 8},
    {MV, MV, 22, 0, 20, MV, MV, 16, 21},
    {MV, MV, MV, 20, 0, 26, MV, 7, MV},
    {11, MV, MV, MV, 26, 0, 17, MV, MV},
    {MV, 16, MV, MV, MV, 17, 0, 19, MV},
    {MV, MV, MV, 16, 7, MV, 19, 0, MV},
    {MV, 12, 8, 21, MV, MV, MV, MV, 0},
};

void Prime(int sv)
{
	int i = 0;
	int j = 0;
	
	if((0<=sv)&&(sv<VNUM))
	{
		for(i=0;i<VNUM;i++)
		{
			Cost[i] = Matrix[sv][i];
			P[i]=sv;
			Mark[i] = 0;
		}
		
		Mark[sv] = 1;
		
		for(i=0;i<VNUM;i++)
		{
			int min = MV;
			int index = -1;
			
			for(j=0;j<VNUM;j++)
			{
				if(!Mark[j]&&(Cost[j]<min))
				{
					min = Cost[j];
					index = j;
				}
			} 
			
			if(index>-1)
			{
				Mark[index] = 1;
				
				printf("(%d, %d, %d)\n",P[index],index,Cost[index]);
			}
			
			for(j=0;j<VNUM;j++)
			{
				if(!Mark[j]&&(Matrix[index][j]<Cost[j]))
				{
					Cost[j] = Matrix[index][j];
					P[j] = index; 
				}
			}
		}
	}
} 

int main(int argc, char *argv[])
{
	Prime(0);
	
	return 0;
}

运行效果：