Pagini recente » Cod sursa (job #875732) | Cod sursa (job #711576) | Cod sursa (job #3126473) | Cod sursa (job #1077087) | Cod sursa (job #35954)
Cod sursa(job #35954)
#include <fstream.h>
ifstream f("traseu.in");
ofstream g("traseu.out");
int n,x[61][61],max=0,vmax,tot,l,apare[61];
void ciclu(int vf,int s)
{
int i;
//v[vf]=1;
if (vf==vmax&&l>0) {tot+=s;l=0;}
else
for (i=1;i<=n;i++)
if (x[vf][i])
{
l++;ciclu(i,s+x[vf][i]);
}
}
int main()
{
int m,a,b,i,c;
f>>n>>m;
for (i=1;i<=m;i++)
{
f>>a>>b>>c;
x[a][b]=c;
apare[a]++;
apare[b]++;
}
for (i=1;i<=n;i++)
if (apare[i]>max) {max=apare[i];vmax=i;}
ciclu(vmax,0);
g<<tot;
f.close();
g.close();
return 0;
}