Cod sursa(job #1828447)

Utilizator GeanaVladGeana Vlad GeanaVlad Data 13 decembrie 2016 13:04:19
Problema Ciclu hamiltonian de cost minim Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.84 kb
#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=100000,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==100000)
        g<<"Nu exista solutie";
    else
    g<<mn;
}