Home
last modified time | relevance | path

Searched refs:tncount (Results 1 – 4 of 4) sorted by relevance

/dports/cad/gmsh/gmsh-4.9.2-source/contrib/blossom/concorde97/CUT/
H A Dmc_main.c137 int tncount, tecount; local
143 rval = shrink_ones (ncount, ecount, elist, ecap, &tncount, &tecount,
148 printf ("Shrunk graph has %d nodes and %d edges\n", tncount, tecount);
157 ncount = tncount;
165 int tncount, tecount; local
/dports/math/concorde/concorde/CUT/
H A Dmc_main.c178 int tncount, tecount; in main() local
184 rval = shrink_ones (ncount, ecount, elist, ecap, &tncount, &tecount, in main()
189 printf ("Shrunk graph has %d nodes and %d edges\n", tncount, tecount); in main()
198 ncount = tncount; in main()
206 int tncount, tecount; in main() local
/dports/math/concorde/concorde/TSP/
H A Dtsp_lp.c4178 int tncount, ecount; in read_probfile() local
4184 rval = CCtsp_prob_getnnodes (p, &tncount); in read_probfile()
4187 if (ncount != (int *) NULL && *ncount != 0 && tncount != *ncount) { in read_probfile()
4192 *ncount = tncount; in read_probfile()
4199 tncount = *ncount; in read_probfile()
4203 rval = CCtsp_init_cliquehash (&lp->cuts, 2*tncount); in read_probfile()
4206 rval = CCtsp_init_dominohash (&lp->cuts, 2*tncount); in read_probfile()
4260 rval = CCtsp_prob_getcuts (p, &tncount, &(lp->cuts), silent); in read_probfile()
4274 rval = CCtsp_prob_getfixed (p, tncount, &(lp->nfixededges), in read_probfile()
4300 rval = CCtsp_prob_getfulladj (p, tncount, &(lp->fullcount), in read_probfile()
[all …]
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/blossom/concorde97/TSP/
H A Dtsp_lp.c3472 int tncount, ecount, ccount, rcount; local
3522 rval = CCtsp_prob_getnnodes (p, &tncount);
3525 if (tncount != ncount) {