Cod sursa(job #688023)

Utilizator d0llaMot Ioana d0lla Data 22 februarie 2012 22:47:14
Problema Algoritmul lui Dijkstra Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.76 kb
#include<iostream>
#include<fstream>
#include<limits.h>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
int C[50001][50001],n,m;

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 (C[i][k]!=INT_MAX && C[k][j]!=INT_MAX)
               if (C[i][j]>C[i][k]+C[k][j])
                  C[i][j] = C[i][k]+C[k][j];
}

void citire()
{
	int i,j,a,b,c;
	f>>n>>m;
	for(i=1;i<=n;i++)
	for(j=1;j<=n;j++)
	C[i][j]=INT_MAX;
	for(i=1;i<=m;i++)
	{
		f>>a>>b>>c;
		C[a][b]=c;
	}

}

void afisare()
{
    int i,j;
	for(j=2;j<=n;j++)
	cout<<C[1][j]<<" ";
}

int main()
{
	citire();    
	roy_floyd();
	afisare();
	f.close();
	g.close();
	return 0;
}