Pagini recente » Cod sursa (job #2240897) | Cod sursa (job #15295) | Cod sursa (job #2285770) | Cod sursa (job #2023931) | Cod sursa (job #873056)
Cod sursa(job #873056)
#include <stdio.h>
#include<fstream>
using namespace std;
ifstream f ("ubuntzei.in");
ofstream g ("ubuntzei.out");
int n, a[2000][2000],v1,v2,v3,v[2000],k,m;
void citire()
{
int i, j;
f>>n>>m>>k;
for ( i=1; i<=k; i++ )
f>>v[i];
for ( i=1; i<=m; i++ )
{
f>>v1>>v2>>v3;
a[v1][v2]=v3;
a[v2][v1]=v3;
}
}
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 (a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j)
a[i][j] = a[i][k] + a[k][j];
}
void afisare()
{
g<<a[1][n];
}
int main()
{
citire();
roy_floyd();
afisare();
}