图论--Dijkstra算法

#include
#include
#include
#include
#include

#define INF 0x3f3f3f3f

using namespace std;

const int maxn = 10005;

int a[maxn][maxn];

int vis[maxn], dist[maxn];

long long n, m;

int u, v, w;

long long sum = 0;

int Dijkstra(int s)
{
dist[s] = 0;

for (int i = 1; i <=n; i++)
{
	int cur = -1;
	for (int j = 1; j <=n; j++)
	{
		if (!vis[j] && (cur == -1 || dist[j] < dist[cur]))
		{
			cur = j;
		}
	}

	if (dist[cur] > INF)return INF;

	sum = sum + dist[cur];

	vis[cur] = 1;

	for (int k = 1; k <=n; k++)
	{
		if (a[cur][k]!=INF && dist[k] > dist[cur] + a[cur][k])dist[k] = dist[cur] + a[cur][k];
	}

}

int max = 0;//找一个距离源点最远点的距离
for (int i = 1; i <= n; i++)
{
    if (dist[i] != INF)
	{
	if (dist[i] > max)
		max = dist[i];
	}
}

return max;

}

int main(void) {
scanf("%d%d", &n, &m);
memset(a, 0x3f, sizeof(a));
memset(dist, 0x3f, sizeof(dist));
for (int i = 1; i <= m; i++) {
scanf("%d%d%d", &u, &v, &w);
a[u][v] = min(a[u][v], w);
a[v][u] = min(a[v][u], w);
}
int value = Dijkstra(1);

 for (int i=1;i<=n;i++)//将所有1作为源点的最短路径打印
 {

     cout<<dist[i]<<endl;
 }

return 0;

}

测试数据

6 9
1 2 1
1 3 12
2 3 9
2 4 3
3 5 5
4 3 4
4 5 13
4 6 15
5 6 4