Cod sursa(job #889675)

Utilizator ionutpPala Ionut ionutp Data 24 februarie 2013 17:29:57
Problema Algoritmul lui Dijkstra Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.83 kb
#include<fstream>
using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

const float inf = 0XFFFFFFFF;
int n, m, A[20000][20000], c;

void Read()
{
    int x, y;
    fin >> n >> m;
    for(int i = 1; i <= n; i++)
    for(int j = 1; j <= n; j++)
    if(i == j)
    A[i][j] = 0;
    else
    A[i][j] = inf;
    for(int i = 1; i <= m; i++)
    {
        fin >> x >> y >> c;
        A[x][y] = c;
    }
}
void RoyFloyd()
{
    for(int k = 1; k <= n; k++)
    for(int i = 1; i <= n; i++)
    for(int j = 1; j <= n; j++)
    if(A[i][j] > A[i][k] + A[k][j])
    A[i][j] = A[i][k] + A[k][j];
}
void Write()
{
    for(int i = 2; i <= n; i++)
        fout << A[1][i] << " ";
}
int main()
{
    Read();
    RoyFloyd();
    Write();
    fin.close();
    fout.close();
    return 0;
}