DJKISTRA

___________________________________________________________________________________
__________________________
#include <iostream>
#include <fstream>
#define INFINIT 1000000000
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n , a[105][105], v[105], d[105], t[105];
int main()
{
int i,j,c,p;
fin>>n>>p;
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
a[i][j]=INFINIT;
while( fin >> i >> j >> c )
a[i][j] = c;
for(i =1 ; i <= n ; i ++ )
{
v[i] = 0;
d[i] = a[p][i];
t[i] = p;
}
v[p] = 1, t[p] = 0, d[p] = 0;
d[0] = INFINIT;
for(int k = 1 ; k < n ; ++k)
{
int pmax = 0;
for(i = 1 ; i <= n ; ++i)
if(v[i] == 0 && d[i] < d[pmax])
pmax = i;
if(pmax > -1)
{
v[pmax] = 1;
for(i = 1; i <= n ; ++i)
if(v[i] == 0 && d[i] > d[pmax] + a[pmax][i])
d[i] = d[pmax] + a[pmax][i], t[i] = pmax;
}
}
for(i = 1 ;i <= n ; ++i)
fout << (d[i] != INFINIT ? d[i] : -1) << " ";
return 0;
}

___________________________________________________________________________________
____________________________________
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
int n,m,a[101][101],i,j,p,c,d[100],s[100],t[100],poz,mn,mx=10000;
int main()
{
int x,y;
f>>n>>p;
for(i=1;i<=n;i++)
 for(j=1;j<=n;j++)
if(i!=j)
a[i][j]=mx;
while(f>>x>>y>>c)
a[x][y]=c;
s[p]=1;
for(i=1;i<=n;i++)
{
d[i]=a[p][i];
if(i!=p)
if(d[i]<mx)
t[i]=p;
}
for(i=1;i<n;i++)
{
mn=mx;
for(j=1;j<=n;j++)
if(s[j]==0)
if(d[j]<mn)
{
mn=d[j];
poz=j;
}
s[poz]=1;
for(j=1;j<=n;j++)
if(s[j]==0)
if(d[j]>d[poz]+a[poz][j])
{
d[j]=d[poz]+a[poz][j];
t[j]=poz;
}
}
for(i=1;i<=n;i++)
if(d[i]<10000)
g<<d[i]<<" ";
else g<<-1<<" ";
return 0;
}