disjktra最短路径问题

#include<bits/stdc++.h>
using namespace std;



int main()
{
	int e[10][10], dis[10], book[10], i, j, n, m, t1, t2, t3, u, v, min;
	int inf = 99999;
	scanf("%d %d", &n, &m);
	for (i = 1; i <= n; i++)
	{
		for (int j = 1; j <= m; j++)
		{
			if (i == j)
			{
				e[i][j] = 0;
			}
			else
			{
				e[i][j] = inf;
			}
		}
	}
	for (i = 1; i <= n; i++)
	{
		dis[i] = e[1][i];
	}
	for (i = 1; i <= n; i++)
	{
		book[i] = 0;
	}
	book[1] = 1;

	for (i = 1; i <= n - 1; i++)
	{
		min = inf;
		for (j = 1; j <= n; j++)//找到距离顶点1最小的那个
		{
			if (book[j] == 0 && dis[j] < min)
			{
				min = dis[j];
				u = j;
			}
		}
		book[u] = 1;
		for (v = 1; v <= n; v++)
		{
			if (e[u][v] < inf)
			{
				if (dis[v] > dis[u] + e[u][v])
				{
					dis[v] = dis[u] + e[u][v];
				}
			}
		}
	}
	for (i = 1; i <= n; i++)
	{
		cout << dis[i];
	}
	return 0;

}