Pagini recente » Cod sursa (job #1343126) | Cod sursa (job #1838918) | Cod sursa (job #2802054) | Cod sursa (job #2178695) | Cod sursa (job #1606107)
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
int v[20][20],n,m;
int c,a,b;
int cost[20];
void citire()
{
f>>n>>m;
for(int i=1;i<=n;i++)
{
f>>a>>b>>c;
v[a][b]=c;
}
}
void djstra(int k)
{
for(int i=1;i<=n;i++)
{
if(v[k][i]!=0)
{
if(cost[i]>v[k][i]+cost[k])
{
cost[i]=v[k][i]+cost[k];
}
djstra(i);
}
}
}
int main()
{
citire();
for(int i=1;i<=n;i++)cost[i]=INT_MAX;
cost[1]=0;
djstra(1);
for(int i=2;i<=n;i++)g<<cost[i]<<" ";
return 0;
}