ProgramAlgTrain/20240919/CSP常考算法模板/最短路径/多源最短路径Floyed.cpp

59 lines
1.1 KiB
C++
Raw Normal View History

2024-09-19 02:22:41 +00:00
#include <bits/stdc++.h>
using namespace std;
int a[101][3];
double f[101][101];
int n,i,j,k,x,y,m,s,e;
int main()
{
// freopen("short.in","r",stdin);
// freopen("short.out","w",stdout);
cin >> n;
for (i = 1; i <= n; i++)
cin >> a[i][1] >> a[i][2];
cin >> m;
memset(f,0x7f,sizeof(f)); //<2F><>ʼ<EFBFBD><CABC>f<EFBFBD><66><EFBFBD><EFBFBD>Ϊ<EFBFBD><CEAA><EFBFBD><EFBFBD>ֵ
//Ԥ<><D4A4><EFBFBD><EFBFBD><EFBFBD><EFBFBD>x<EFBFBD><78>y<EFBFBD><79><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
// for (i = 1; i <= m; i++)
// {
// cin >> x >> y;
// f[y][x] = f[x][y] = sqrt(pow(a[x][1]-a[y][1],2)+pow(a[x][2]-a[y][2],2));
// //pow(x,y)<29><>ʾx^y<><79><EFBFBD><EFBFBD><EFBFBD><EFBFBD>x,y<><79><EFBFBD><EFBFBD>Ϊdouble<6C><65><EFBFBD>ͣ<EFBFBD>Ҫ<EFBFBD><D2AA>cmath<74><68>
// }
for (i = 1; i <= n; i++)
f[i][i]=0;
cin >> s >> e;
for (k = 1; k <= n; k++) //k<><6B>ʾ<EFBFBD><CABE>ת<EFBFBD><D7AA> //floyed <20><><EFBFBD><EFBFBD>·<EFBFBD>
{
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
{
if (f[i][k]+f[k][j] < f[i][j])
f[i][j] = f[i][k] + f[k][j];
}
}
}
printf("%.2lf\n",f[s][e]);
return 0;
}
/*
5
0 0
2 0
2 2
0 2
3 1
5
1 2
1 3
1 4
2 5
3 5
1 5
*/