Pagini recente » Cod sursa (job #2117545) | Cod sursa (job #2120531) | Cod sursa (job #1748659) | Cod sursa (job #3208618) | Cod sursa (job #601637)
Cod sursa(job #601637)
#include <fstream>
using namespace std;
int m[100][100];
int n;
ifstream fi;
ofstream fo;
int main()
{
fi.open("royfloyd.in");
fi >> n;
for (int i=1; i<=n; i++)
for (int j=1; j<=n; j++)
fi >> m[i][j];
fi.close();
// RF
for (int k=1; k<=n; k++)
for (int i=1; i<=n; i++)
if (m[i][k] != 0)
for (int j=1; j<=n; j++)
if ((m[k][j] !=0) && (i!=j))
m[i][j] = min(m[i][j], m[i][k] + m[k][j]);
fo.open("royfloyd.out");
for (int i=1; i<=n; i++)
{
for (int j=1; j<=n; j++)
fo << m[i][j] << " ";
fo << "\n";
}
fo.close();
}