最短路径算法

一、Floyd算法

例题http://acm.mangata.ltd/p/P1507

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

const int N = 2e2+10;
const int INF = 0x3f3f3f3f;

int n,m,k;
int f[N][N];

void Floyd(){
	for(int k = 1;k <= n; ++k)
		for(int i = 1;i <= n; ++i)
			for(int j = 1;j <= n; ++j)
				f[i][j] = min(f[i][j],f[i][k]+f[k][j]);
}

int main()
{
	cin>>n>>m>>k;
	int u,v,w;

	for(int i = 1;i <= n; ++i)
		for(int j = 1;j <= n; ++j)
			f[i][j] = i==j?0:INF;

	for(int i = 1;i <= m; ++i){
		cin>>u>>v>>w;
		f[u][v] = min(f[u][v],w);
	}
	Floyd();
	while(k--){
		cin>>u>>v;
		if(f[u][v] > INF / 2) cout<<"impossible"<<endl;
		else cout<<f[u][v]<<endl;
	}


	return 0;
}

二、Dijkstra算法

例题https://ac.nowcoder.com/acm/contest/27274/E

#include<cstdio>
#include<algorithm>
#include<vector>
#include<iostream>
#include<cstring>

using namespace std;
#define INF 0x3f3f3f3f
const int N = 1e3+10;

int f[N][N],n,m,dis[N];
bool vis[N];

void DJ(int s){
	for(int i = 1;i <= n; ++i) dis[i] = INF,vis[i] = false;
	dis[s] = 0;
	for(int i = 1;i <= n; ++i) {
		int t = -1;
		for(int j = 1;j <= n; ++j) 
			if(!vis[j] && (t == -1 || dis[j] < dis[t])) t = j;
		if(t == -1) return;
		vis[t] = true;
		for(int j = 1;j <= n; ++j)
			if(dis[j] > dis[t] + f[t][j])
				dis[j] = dis[t] + f[t][j];
	}
}

int main()
{
    int s,t;
	cin>>n>>m>>s>>t;
	int u,v,w;
	memset(f,0x3f,sizeof f);
	for(int i = 1;i <= m; ++i){
		cin>>u>>v>>w;
		f[v][u] = f[u][v] = min(f[u][v],w);
	}
	DJ(s);
	if(dis[t] == INF) cout<<"-1"<<endl;
	else cout<<dis[t]<<endl;
	return 0;
}

三、SPFA

例题https://ac.nowcoder.com/acm/contest/27274/E

#include<algorithm>
#include<cstring>
#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>

const int INF = 0x3f3f3f3f;
const int N = 10000+10;

using namespace std;

struct Node{
	int v,w;
};
vector<Node> E[N]; 
int n,m,s,t;
int dis[N];
bool vis[N];

void SPFA(int s){
	for(int i = 1;i <= n; ++i) 
		vis[i] = false,dis[i] = INF;
	queue<int> que;
	que.push(s);
	dis[s] = 0,vis[s] = true;
	while(!que.empty()){
		int t = que.front();
		que.pop();
		vis[t] = false;
		for(int i = 0,l = E[t].size();i < l; ++i) {
			int j = E[t][i].v;
			int k = E[t][i].w;
			if(dis[j] > dis[t] + k){
				dis[j] = dis[t] + k;
				if(!vis[j]){
					vis[j] = true;
					que.push(j);
				}
			}
		}
	}
}
int main()
{
	cin>>n>>m>>s>>t;
	int u,v,w;
	for(int i = 1;i <= m; ++i) {
		cin>>u>>v>>w;
		E[u].push_back({v,w});
		E[v].push_back({u,w});
	}
	
	SPFA(s);
	if(dis[t] >= INF / 2) cout<<"-1"<<endl;
	else cout<<dis[t]<<endl;
	
}