Cod sursa(job #1441110)

Utilizator petremariaPetre Maria petremaria Data 23 mai 2015 17:43:49
Problema Algoritmul lui Dijkstra Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.56 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("dijkstra.txt");
ofstream g("dijkstra.txt");
long long a[9000][9000];
int main()
{
    int i,j,k,n,m,x,y,z;
    f>>n>>m;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            a[i][j]=10000;
    for(i=1;i<=m;i++)
    {
        f>>x>>y>>z;
        a[x][y]=z;
    }
    for(k=1;k<=n;k++)
        for(j=1;j<=n;j++)
            if((a[1][k]+a[k][j]<a[1][j])&&(i!=k)&&(j!=k))
                a[1][j]=a[1][k]+a[k][j];
    for(i=2;i<=n;i++)
        g<<a[1][i]<<" ";
	return 0;
}