Pagini recente » Cod sursa (job #72805) | Cod sursa (job #317850) | Cod sursa (job #417599) | Cod sursa (job #888166) | Cod sursa (job #1917047)
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n,g[101][101],a[101][101];
void citire_graf()
{
int c;
in>>n;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
in>>a[i][j];
}
}
void RoyFloyd()
{
int i,j;
for(int k = 1; k <= n; k++)
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++) //daca putem actualiza
if(a[i][k] && a[k][j] && i != j && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]))
a[i][j] = a[i][k] + a[k][j];
}
void afisare_graf()
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
out<<a[i][j]<<" ";
out<<endl;
}
}
int main()
{
citire_graf();
RoyFloyd();
afisare_graf();
in.close();
out.close();
return 0;
}