UVA 10806 Dijkstra, Dijkstra. spfa

点击打开题目链接

从 1 到 n 求两次最短路，每条边只能走一次

这里用两次spfa算法求，第一次求后将路径上的边更新

假如经过了边 (u,v)  则先将 w[ v ][ u ] 修改为 -w[ u ][ v ]

再将 w[ u ][ v ]  修改为INF， 然后第二次spfa

两次的最短距离累加即可，拙图希望让你更清晰

#include <cstdio>
#include <cstring>
#include <queue>
#include <iostream>
using namespace std;

const int INF = 6000000;
const int maxn = 100 + 5;
int w[maxn][maxn], d[maxn];
int vis[maxn], fa[maxn];
int n, m;

void spfa()
{
	memset(vis, 0, sizeof(vis));
	memset(fa, -1, sizeof(fa));
	for (int i = 1; i <= n; i++) d[i] = (i == 1 ? 0 : INF);
	queue<int> Q;
	Q.push(1);
	vis[1] = 1;
	
	while (!Q.empty())
	{
		int x = Q.front();
		Q.pop();
		vis[x] = 0;
		for (int y = 1; y <= n; y++) if (d[y] > d[x] + w[x][y])
		{
			d[y] = d[x] + w[x][y];
			fa[y] = x;
			if (!vis[y])
			{
				vis[y] = 1;
				Q.push(y);
			}
		}
	}
}

int main()
{
	while (~scanf("%d", &n))
	{
		if (n == 0) break;
		scanf("%d", &m);
		for (int i = 0; i <= n; i++)
		{
			for (int j = 0; j <= n; j++)
			{
				w[i][j] = w[j][i] = (i == j ? 0 : INF);
			}
		}
		for (int i = 0; i < m; i++)
		{
			int u, v, x;
			scanf("%d%d%d", &u, &v, &x);
			w[u][v] = w[v][u] = x;
		}
		
		spfa();
		int ans = d[n];
		int S = 1, T = n;
		while ( T != S)
		{
			w[T][fa[T]] = - w[T][fa[T]];
			w[fa[T]][T] = INF;
			T = fa[T];
		}
		spfa();
	
		if (ans == INF || d[n] == INF)
		{
			printf("Back to jail\n");
			continue;
		}
		ans += d[n];
		printf("%d\n", ans);
	}
	return 0;
}

还有很多用最小费用流做的，研究中