图的最短路径问题

1.迪杰斯特拉算法（一个源点到其他顶点）

//迪杰斯特拉函数实现
void dijstra(const MGraph* G, int v, ShortDist dist[])
{
	int minCost = 0, minPos = 0, i = 0, j = 0, flag[MAXSize] = { 0 };
	flag[v] = 1;//从序号为v的顶点出发
	//dist数组的初始化
	for (i = 0; i < G->vexNum; i++)
	{
		dist[i].distance = G->arcs[v][i];
		if (G->arcs[v][i] != MAXCONST)dist[i].path = v;
		else dist[i].path = -1;
	}
	while (1)//按距离递增顺序找出从v出发到其余各个顶点的最短路径
	{
		//求距离的最小值
		minPos = v; minCost = MAXCONST;
		for (j = 0; j < G->vexNum; j++)
		{
			if (flag[j] == 0 && dist[j].distance < minCost)
			{
				minCost = dist[j].distance;
				minPos = j;
			}
		}
		if (minPos == MAXCONST)break;//算法结束
		flag[minPos] = 1;//对已完成的顶点做标记
		//更新dist数组
		for (j = 0; j < G->vexNum; j++)
		{
			if (flag[j] == 0
				&& dist[minPos].distance + G->arcs[minPos][j] < dist[j].distance)
			{
				dist[j].distance = dist[minPos].distance + G->arcs[minPos][j];
				dist[j].path = minPos;
			}
		}
	}//end_while(1)
}

2. 弗洛伊德算法（每一对顶点之间的最短路径算法）

//弗洛伊德算法——求图中每一对顶点之间的最短路径算法
void floyd(const MGraph* G, int dist[][MAXSize], int path[][MAXSize])
{
	int i = 0, j = 0, k = 0, m = 0, n = 0;
	for (i = 0; i < G->vexNum; i++)
	{
		for (j = 0; j < G->vexNum; j++)
		{
			dist[i][j] = G->arcs[i][j];
			if (dist[i][j] != MAXCONST && dist[i][j] != 0)
				path[i][j] = i;
			else path[i][j] = -1;
		}
	}
	for(k=0;k<G->vexNum;k++)
		for (i = 0; i < G->vexNum; i++)
		{
			for (j = 0; j < G->vexNum; j++)
			{
				if (dist[i][k] + dist[k][j] < dist[i][j])
				{
					dist[i][j] = dist[i][k] + dist[k][j];
					path[i][j] = k;
				}
			}
		}
}