传送门
话说这么简单的floyed暴力还要看题解吗?
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#define ll long long
using namespace std;
double w[105][105],s;
ll f[105][105];
int n,m,x,y,z;
int main(){
scanf("%d%d",&n,&m);
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++) f[i][j]=1e15;
for (int i=1;i<=m;i++){
scanf("%d%d%d",&x,&y,&z);
f[x][y]=f[y][x]=z;
w[x][y]=w[y][x]=1;
}
for (int k=1;k<=n;k++)
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
if (k!=i&&k!=j&&i!=j){
if (f[i][k]+f[k][j]<f[i][j]){
f[i][j]=f[i][k]+f[k][j];
w[i][j]=0;
}
if (f[i][k]+f[k][j]==f[i][j]) w[i][j]+=w[i][k]*w[k][j];
}
for (int i=1;i<=n;i++){
s=0;
for (int j=1;j<=n;j++)
for (int k=1;k<=n;k++)
if (i!=j&&i!=k&&j!=k&&f[k][i]+f[i][j]==f[k][j])
s+=(w[k][i]*w[i][j])/w[k][j];
printf("%.3lf\n",s);
}
}