poj1734 无向图最小环

要求对floyd算法有一定的理解。

有一个神奇的地方：路径是边做边更新的，防止了出现重复的点。（在不同的k时更新的路径，中间点g[i][j]是会变化的）

#include<bits/stdc++.h>
using namespace std;
#define rep(x,y,z) for (int x=y; x<=z; x++)
#define downrep(x,y,z) for (int x=y; x>=z; x--)
#define ms(x,y,z) memset(x,y,sizeof(z))
#define LL long long
#define repedge(x,y) for (int x=hed[y]; ~x; x=edge[x].nex)
inline int read(){
	int x=0; int w=0; char ch=0;
	while (ch<'0' || ch>'9') w|=ch=='-',ch=getchar();
	while (ch>='0' && ch<='9') x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
	return w? -x:x;
}
const int maxn=105;
const LL inf=1e9;
int n,m,g[maxn][maxn],path[maxn*2],tot;
LL dis[maxn][maxn],e[maxn][maxn],ans;
struct node{ int fr,se,th; }ANS;
node make_node(int a,int b,int c){ node x; x.fr=a; x.se=b; x.th=c; return x; }
void get_path(int i,int j){
	if (dis[i][j]==e[i][j]) return;
	get_path(i,g[i][j]); path[++tot]=g[i][j]; get_path(g[i][j],j);
}
void floyd(){
	rep(i,1,n) rep(j,1,n) dis[i][j]=e[i][j]; ans=inf;
	rep(k,1,n) {
		rep(i,1,n) rep(j,1,n) if ((i<j)&&(j<k)) {
			LL tmp=dis[i][j]+e[j][k]+e[k][i]; 
			if (tmp<ans){ tot=0; path[++tot]=i;
			get_path(i,j); path[++tot]=j; path[++tot]=k; ans=tmp; }
		}
		rep(i,1,n) rep(j,1,n) {
			LL tmp=dis[i][k]+dis[k][j];
			if (tmp<dis[i][j]){ g[i][j]=k; dis[i][j]=tmp; }
		}
	}
}

int main(){
	//freopen("trip5.in","r",stdin);
	//freopen("my.out","w",stdout);
	n=read(); m=read();
	rep(i,1,n) rep(j,1,n) e[i][j]=inf; rep(i,1,n) e[i][i]=0;
	rep(i,1,m) { int u=read(); int v=read(); 
	e[u][v]=e[v][u]=min(e[u][v],read()*1LL); }
	floyd(); if (ans>=inf) puts("No solution."); 
	else { rep(i,1,tot-1) printf("%d ",path[i]); printf("%d\n",path[tot]); }
	return 0;
}