迪杰斯特拉算法实现

迪杰斯特拉算法的原理如下，首先找到最近的点，然后将之归为一类，然后再寻找另一类中距离最短的顶点，依次寻找，即可找到。下图的链接是：http://www.cnblogs.com/biyeymyhjob/archive/2012/07/31/2615833.html

另外，在VS2010中，查看全局变量，应该使用watch窗口。

#include <stdio.h>

#define INFINITE 0x0FFF
#define NumVertice 10

int shortestDist[NumVertice];
int prevVertices[NumVertice];

int neighborDist[NumVertice][NumVertice] = {{0,5,4,2,INFINITE,INFINITE,INFINITE,INFINITE,INFINITE,INFINITE},
{5,0,3,INFINITE,6,3,4,INFINITE,INFINITE,INFINITE },
{4,3,0,1,INFINITE,INFINITE,INFINITE,INFINITE,INFINITE,INFINITE },
{2,INFINITE,1,0,2,8,7,INFINITE,INFINITE,INFINITE},
{INFINITE,6,INFINITE,2,0,INFINITE,INFINITE,INFINITE,INFINITE,7},
{INFINITE,3,INFINITE,8,INFINITE,0,5,4,3,2},
{INFINITE,4,INFINITE,7,INFINITE,5,0,2,INFINITE,INFINITE},
{INFINITE,INFINITE,INFINITE,INFINITE,INFINITE,4,2,0,7,INFINITE},
{INFINITE,INFINITE,INFINITE,INFINITE,INFINITE,3,INFINITE,7,0,6},
{INFINITE,INFINITE,INFINITE,INFINITE,7,2,INFINITE,INFINITE,6,0}};

int Dijkstra(int start)
{
	bool visited[NumVertice]={false};
	visited[start]=true;
	int visitedFlag=NumVertice-1;
	for (int index=0;index<NumVertice;index++)
	{
		shortestDist[index]=neighborDist[start][index];
		if (shortestDist[index]==INFINITE)
		{
			prevVertices[index]=-1;
		}
		else
		{
			prevVertices[index]=start;
		}
	}
	while (visitedFlag)
	{
		int tempMin=INFINITE, curVertice=start;
		for (int innerIndex=0;innerIndex<NumVertice;innerIndex++)
		{
			printf("%d\t",visited[innerIndex]==false && innerIndex<NumVertice);
			if (visited[innerIndex]==false && shortestDist[innerIndex]<tempMin)
			{
				tempMin = shortestDist[innerIndex];
				curVertice = innerIndex;
			}
		}
		visited[curVertice]=true;
		visitedFlag--;
		for (int innerIndex2 = 0; innerIndex2<NumVertice;innerIndex2++)
		{
			printf("%d\t",visited[innerIndex2]==false && innerIndex2<NumVertice);
			if (visited[innerIndex2]==false && neighborDist[curVertice][innerIndex2]<INFINITE && neighborDist[curVertice][innerIndex2]+shortestDist[curVertice]<shortestDist[innerIndex2] )
			{
				shortestDist[innerIndex2] = neighborDist[curVertice][innerIndex2]+shortestDist[curVertice];
				prevVertices[innerIndex2] = curVertice;				
			}
		}
	}
	return 0;
}

int main()
{


	
	for (int outIndex=0;outIndex<NumVertice;outIndex++)
	{
		for (int innerIndex=0;innerIndex<NumVertice;innerIndex++)
		{
			printf("%d\t",neighborDist[outIndex][innerIndex]);
		}
		printf("\n");
	}
	Dijkstra(0);
	for (int index=0;index<NumVertice;index++)
	{
		printf("for #%d vertical, shortest path length is %d and its previous vertical is %d\n",index,shortestDist[index],prevVertices[index]);
	}
	getchar();
	return 0;
}