Pagini recente » Cod sursa (job #519207) | Cod sursa (job #2459663) | Cod sursa (job #1869220) | Cod sursa (job #2165751) | Cod sursa (job #2814343)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
class Graf
{
int numar_noduri;
public:
void citire();
vector <vector <int>> roy_floyd(vector <vector <int>>matrice_ponderi, int cost)
{
vector <vector <int>> distante = matrice_ponderi;
for(int i = 1; i <= numar_noduri; i++)
for(int j = 1; j <= numar_noduri; j++)
if(i != j && !matrice_ponderi[i][j])
distante[i][j] = cost;
for(int i = 1; i <= numar_noduri; i++)
for(int j = 1; j <= numar_noduri; j++)
for(int k = 1; k <= numar_noduri; k++)
if(j == k && distante[j][k] > distante[j][i] + distante[i][k])
distante[j][k] = distante[j][i] + distante[i][k];
return distante;
}
};
void Graf :: citire()
{
fin >> numar_noduri;
vector <vector <int>> matrice_ponderi;
matrice_ponderi.resize(numar_noduri + 1);
for(int i = 1; i <= numar_noduri; i++)
{
matrice_ponderi[i].resize(numar_noduri + 1);
for(int j = 1; j <= numar_noduri; j++)
fin >> matrice_ponderi[i][j];
}
vector <vector <int>> distante = roy_floyd(matrice_ponderi, 1001);
for(int i = 1; i <= numar_noduri; i++)
{
for(int j = 1; j <= numar_noduri; j++)
fout << distante[i][j] << " ";
fout << '\n';
}
}
int main()
{
Graf x;
x.citire();
fin.close();
fout.close();
return 0;
}