Pagini recente » Cod sursa (job #1352471) | Cod sursa (job #1112095) | Cod sursa (job #964552) | Cod sursa (job #2025568) | Cod sursa (job #1828448)
#include <iostream>
#include<fstream>
#include<vector>
using namespace std;
ifstream f("hamilton.in");
ofstream g("hamilton.out");
int n,m,i,x,y,cst,a[20][20],mn=1000000000,s,j;
bool viz[20];
vector<int>v[20];
void df(int x,int l,int cst)
{
viz[x]=1;
for(int k=0;k<v[x].size();k++)
if(!viz[v[x][k]])
{
df(v[x][k],l+1,cst+a[x][v[x][k]]);
}
else if(v[x][k]==s && l==n)
if(cst+a[x][v[x][k]]<mn)
mn=cst+a[x][v[x][k]];
}
int main()
{
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>x>>y>>cst;
x++;y++;
v[x].push_back(y);
a[x][y]=cst;
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
viz[j]=0;
s=i;
df(s,1,0);
}
if(mn==1000000000)
g<<"Nu exista solutie";
else
g<<mn;
}