Nu exista pagina, dar poti sa o creezi ...
Cod sursa(job #2432544)
Utilizator | Data | 24 iunie 2019 11:48:03 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int v[101][101];
int N;
void read()
{
fin>>N;
for(int i=1;i<=N;i++)
for(int j=1;j<=N;j++)
fin>>v[i][j];
}
void floyd()
{
for(int k=1;k<=N;k++)
for(int i=1;i<=N;i++)
for(int j=1;j<=N;j++)
{
if(i==j) continue;
if(v[i][k]>0&&v[k][j]>0&&v[i][k]+v[k][j]<v[i][j]||a[i][j]==0)
v[i][j]=v[i][k]+v[k][j];
}
}
void write()
{
for(int i=1;i<=N;i++)
{
for(int j=1;j<=N;j++)
fout<<v[i][j]<<' ';
fout<<'\n';
}
}
int main()
{
read();
floyd();
write();
return 0;
}