Pagini recente » Cod sursa (job #2231369) | Cod sursa (job #2453222) | Cod sursa (job #1353217) | Cod sursa (job #297907) | Cod sursa (job #909941)
Cod sursa(job #909941)
#include <iostream>
#include <fstream>
using namespace std;
#define maxn 101
void roy_floyd (int cost[maxn][maxn], int nr_noduri)
{
int i,j,k;
ofstream g("royfloyd.out");
for (k = 1; k <= nr_noduri; k++)
for (i = 1; i <= nr_noduri; i++)
for (j = 1; j <= nr_noduri; j++)
if (cost[i][k] + cost[k][j] < cost[i][j])
cost[i][j] = cost[i][k] + cost[k][j];
for (i = 1; i <= nr_noduri; i++)
{
for (j = 1; j <= nr_noduri; j++)
g<<cost[i][j]<<" ";
g<<"\n";
}
g.close();
}
int main()
{
int i,j,nr_noduri;
ifstream f("royfloyd.in");
f>>nr_noduri;
int cost[maxn][maxn];
for (i = 1; i <= nr_noduri; i++)
for (j = 1; j <= nr_noduri; j++)
f>>cost[i][j];
roy_floyd (cost, nr_noduri);
f.close();
return 0;
}