Dijkstra算法

记录我的学习路程，直接上代码

#include<stdio.h>
#include<stdbool.h>

#define N 100//城市个数
const int INF = 10000000;//无穷大
int map[N][N], dist[N], p[N], n, m;
//n城市顶点个数,m城市间路线条数
//map[i][j]:从城市i到j对应的权值(带权领接矩阵)
//dist[i]:记录源点到i的最短通路长度
//p[i]:记录源点到i顶点的最短路径上的前驱
bool flag[N];
//flag[i]:true说明i已经加入集合S
//否则i属于V-S

Dijkstra(int u)
{
	//初始化源点到其他各个顶点的最短路径长度
	//初始化源点u为前驱
	for (int i = 1; i <= n; i++)
	{
		dist[i] = map[u][i];
		flag[i] = false;
		if (dist[i] == INF)
			p[i] = -1;
		else
			p[i] = u;
	}
	//初始化集合S,令集合S={u},从源点u的最短路径为0
	flag[u] = true;
	dist[u] = 0;//自己到自己
	for (int i = 1; i <= n; i++)
	{
		//找最小:
		//在集合V-S中寻找距离源点u最近的点t
		//若找不到,则跳出循环;否则,将t加入S
		int temp = INF, t = u;
		for (int j = 1; j <= n; j++)
		{
			if (!flag[j] && dist[j] < temp)
			{
				//***!flag[ ]
				t = j;//记录顶点t
				temp = dist[j];
			}
		}
		if (t == u) return;//找不到t,跳出循环
		flag[t] = true;//否则,将t加入S
		for (int j = 1; j <= n; j++)
		{
			if (!flag[j] && map[t][j] < INF)
			{
				if (dist[j]>dist[t] + map[t][j])
				{
					//更新最短路径
					dist[j] = dist[t] + map[t][j];
					p[j] = t;
				}
			}
		}
	}
}

int main()
{
	int u, v, w=0, st;
	printf("请输入城市的个数:");
	scanf("%d", &n);
	printf("\n请输入城市之间的路线个数:");
	scanf("%d", &m);
	printf("\n请输入城市之间的路线以及距离:");
	for (int i=1; i <= n;i++)
		for (int j = 1; j <= n; j++)
		{
			map[i][j] = INF;
			//初始化为无穷大
		}
	printf("\n");
	while (m--)
	{
		
		scanf("%d %d %d", &u, &v, &w);
		//从u->v的权值
		map[u][v] = w;
	}
	printf("\n请输入当前所在位置:");
	scanf("%d", &st);
	Dijkstra(st);
	printf("\n所在位置:");
	for (int i = 1; i <= n; i++)
	{
		printf("\n从%d到%d:", st, i);
		if (dist[i] == INF)
			printf("sorry,无路可达\n");
		else
			printf("最短距离为%d\n", dist[i]);
	}
	return 0;
}