Pagini recente » Cod sursa (job #2710457) | Cod sursa (job #760260) | Cod sursa (job #1163893) | Cod sursa (job #125349) | Cod sursa (job #655296)
Cod sursa(job #655296)
#include<fstream>
using namespace std;
int A[10000][10000],vizitat[10000],T[10000];
int drum[10000],k=0,n,m,d,x,y;
void Citire()
{
int i,j;
fstream f("sate.in",ios::in);
f>>n>>m>>x>>y;
while(f>>i>>j>>d)
A[i][j]=A[j][i]=d;
f.close();
}
void Inversare(int nod)
{
if(nod!=0)
{
Inversare(T[nod]);
drum[k++]=nod;
}
}
void DFS(int nod)
{
int k;
vizitat[nod]=1;
for(k=1; k<=n; k++)
if(A[nod][k]!=0 && vizitat[k]==0)
{
T[k]=nod;
DFS(k);
}
}
void Afisare()
{
fstream g("sate.out",ios::out);
int i,lungime=0;
for(i=0; i<k; i++)
if(drum[i]<drum[i+1])
lungime=lungime+A[drum[i]][drum[i+1]];
else
lungime=lungime-A[drum[i]][drum[i+1]];
g<<lungime;
g.close();
}
int main()
{
Citire();
DFS(x);
if(T[y]!=0)
Inversare(y);
Afisare();
return 0;
}