Cod sursa(job #2027182)
Utilizator | Data | 25 septembrie 2017 18:52:47 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n, d[105][105];
void royFloyd()
{
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(a[i][k] && a[k][j] && d[i][j]>d[i][k]+d[k][j]) d[i][j]=d[i][k]+d[k][j];
}
int main()
{
f>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++) f>>d[i][j];
royFloyd();
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++) g<<d[i][j]<<" ";
g<<'\n';
}
return 0;
}