for (i=0; i < NbCities; i++)
     {
     if (!present (i, hops, path))
       {
       path [hops] = i ;
       dist = distance[me][i] ;
       if (len+dist<minimum)
        tsp (hops+1, len+dist, path, cuts) ;
       }
     }