Cod sursa(job #1808095)

Utilizator eusebiu_gageaGagea Eusebiu-Andrei eusebiu_gagea Data 17 noiembrie 2016 12:32:56
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.18 kb
#include <fstream>
using namespace std;
ifstream f("roy-floyd.in");
ofstream g("roy-floyd.out");

#define inf 1000000000
int n, m, a[101][101], pred[101][101];

void afis(int a[101][101]) {
    int i, j;
    for(i = 1; i <= n; i++) {
        for(j = 1; j <= n; j++) {
            if(a[i][j] == inf)
                a[i][j] = -1;
            g<<a[i][j]<<' ';
        }
        g<<'\n';
    }
}

void cit_graf() {
    int i, j, x, y, c;
    f>>n>>m;
    for(i = 1; i < n; i++)
        for(j = i + 1; j <= n; j++)
            a[i][j] = a[j][i] = inf;
    for(i = 1; i <= m; i++)
    {
        f>>x>>y>>c;
        a[x][y] = c;
        pred[x][y] = x;
    }
}

void Roy_Floyd() {
    int i, j, k;
    for(k = 1; k <= n; k++) {
        for(i = 1; i <= n; i++)
            for(j = 1; j <= n; j++)
                if(a[i][k] + a[k][j] < a[i][j])
                {
                    a[i][j] = a[i][k] + a[k][j];
                    pred[i][j] = pred[k][j];
                }
    }
}

void traseu(int i, int j) {
    if(a[i][j])
        traseu(i, pred[i][j]);
    g<<j<<' ';
}

int main()
{
    cit_graf();
    Roy_Floyd();
    afis(a);
    return 0;
}