dijkstra

#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;

const int N = 510;
int n,m;
int g[N][N];
int dist[N];
bool st[N];

int dijkstra()
{
    memset(dist , 0x3f3f3f3f, sizeof dist);
    dist[1] = 0;
    
	for(int i = 0; i <= n; i ++)
	{
		int t = -1;
		for(int j = 0; j <= n ; j ++)
		{
			if(!st[j] && (t==-1 || dist[t] > dist[j]))
				t = j ;
		}
		st[t] = true;
		
		for(int j = 0; j <= n; j ++)
		{
			dist[j] = min(dist[j], dist[t]+g[t][j]);
		}

	}
	if(dist[n] == 0x3f3f3f3f ) return -1;
	return dist[n];
}



int main()
{
	cin >> n >>m;
	memset(g, 0x3f, sizeof g);
	
	while(m--)
	{
		int a, b, c;
		cin >> a >> b >> c;
		g[a][b] = min(g[a][b], c);
	}
	printf("%d", dijkstra());
	return 0;
}

查询任意两个结点的距离：
求start 到end 的距离

#include <iostream>
#include <algorithm>
#include <cstring>

using namespace std;
const int N = 510;

int n , m ;
int g[N][N];
int dist[N];
bool st[N];

int dijkstra(int start, int end)
{
	memset(dist, 0x3f3f3f3f, sizeof dist);
	dist[start] =0;
	for(int i = 1; i <= n ;i ++)
	{
		int t= -1;
		for(int j = 1 ; j <= n ; j ++)
		{
			if(!st[j] && (t == -1 || dist[t] > dist[j]))
			t = j;
		}
		st[t] = true;
// 		cout << st[t] <<endl;
		for(int j = 1 ; j <= n; j ++)
		{
			dist[j] = min(dist[j], dist[t]+g[t][j]);
		} 
		
	}
		
	if(dist[end] > 0x3f3f3f3f/2) return -1;
	return dist[end];
 } 
 
 int main()
 {
 	cin >> n >> m;
 	memset(g, 0x3f, sizeof g);
 	while(m--)
 	{
 		int a, b, c;
 		cin >> a >> b >> c;
 		g[a][b]= min(g[a][b], c);
	}
	
	int start, end;
	cin >> start >> end;
	cout << dijkstra(start, end) << endl;
 }

测试样例：

8 11
1 2 3
1 4 2
2 8 5
2 3 4
2 5 3
3 1 1
3 5 1
3 7 1
3 6 3
4 3 1
3 2 1
4 8