Home
last modified time | relevance | path

Searched refs:ptour (Results 1 – 17 of 17) sorted by relevance

/dports/math/concorde/concorde/TSP/
H A Dconcorde.c114 int ncount, int *ptour, char *in_fullfname),
134 int *ptour = (int *) NULL; in main() local
261 ptour = CC_SAFE_MALLOC (ncount, int); in main()
262 CCcheck_NULL (ptour, "out of memory for ptour"); in main()
263 for (i = 0; i < ncount; i++) ptour[i] = i; in main()
276 ptour = CC_SAFE_MALLOC (ncount, int); in main()
277 CCcheck_NULL (ptour, "out of memory for ptour"); in main()
301 rval = CCutil_datagroup_perm (ncount, &dat, ptour); in main()
305 rval = CCutil_putmaster (buf, ncount, &dat, ptour); in main()
676 CC_IFFREE (ptour, int); in main()
[all …]
H A Dpoolcat.c52 int *ptour = (int *) NULL; in main() local
71 if (CCutil_getmaster (av[k+1], &ncount, &dat, &ptour)) { in main()
214 pperm[i] = perm[ptour[i]]; in main()
217 ptour[i] = pperm[i]; in main()
221 rval = CCtsp_file_cuts_write ("merge.txt", pool, ptour); in main()
245 CC_IFFREE (ptour, int); in main()
H A Dsubgrunt.c8 CCdatagroup *dat, int *ptour, double *lbound, CCrandstate *rstate);
144 CCdatagroup *dat, int *ptour, double *lbound, CCrandstate *rstate) in process_subproblem() argument
161 CCutil_cycle_len (ncount, dat, ptour, &ptour_len); in process_subproblem()
178 0, ptour, ptour_len, pool, 0, rstate); in process_subproblem()
H A Dbcontrol.c151 int *ptour; member
283 int *bbcount, int usecliques, CCdatagroup *dat, int *ptour, in CCtsp_bfs_brancher() argument
329 info.ptour = ptour; in CCtsp_bfs_brancher()
381 CCdatagroup *dat, int *ptour, CCtsp_lpcuts *pool, int ncount, in CCtsp_bfs_restart() argument
421 info.ptour = ptour; in CCtsp_bfs_restart()
787 info.ptour = (int *) NULL; in CCtsp_grunt()
851 CC_IFFREE (info.ptour, int); in CCtsp_grunt()
1757 info->ncount, info->dat, info->ptour, info->upbound, in do_task()
1781 info->ncount, info->dat, info->ptour, info->upbound, in do_task()
1859 info->dat, info->ptour, info->upbound, info->pool, in do_task()
[all …]
H A Dcontrol.c149 int ncount, CCdatagroup *dat, int *ptour, double upbound,
3024 CCdatagroup *dat, int *ptour, double *upbound, CCtsp_lpcuts *pool, in CCtsp_bb_cutting() argument
3037 rval = bb_cutting_work (&lp, probname, probnum, ncount, dat, ptour, in CCtsp_bb_cutting()
3185 int ncount, CCdatagroup *dat, int *ptour, double initial_ub, in bb_cutting_work() argument
3194 rval = CCtsp_bb_init_lp (lp, probname, probnum, ncount, dat, ptour, in bb_cutting_work()
H A Dbranch.c3703 CCdatagroup *dat, int *ptour, double *upperbound, CCtsp_lpcuts *pool, in CCtsp_bb_find_branch() argument
3718 rval = CCtsp_bb_init_lp (&lp, probname, probnum, ncount, dat, ptour, in CCtsp_bb_find_branch()
3798 CCdatagroup *dat, int *ptour, double initial_ub, CCtsp_lpcuts *pool, in CCtsp_bb_splitprob() argument
3810 rval = CCtsp_bb_init_lp (&lp, probname, probnum, ncount, dat, ptour, in CCtsp_bb_splitprob()
3822 rval = CCtsp_bb_init_lp (&lp, probname, probnum, ncount, dat, ptour, in CCtsp_bb_splitprob()
H A Dtsp_lp.c346 CCdatagroup *dat, int *ptour, double initial_ub, CCtsp_lpcuts *pool, in CCtsp_bb_init_lp() argument
353 ptour, initial_ub, pool, (CCtsp_lpcuts *) NULL, silent, in CCtsp_bb_init_lp()
360 int exvalid, int *ptour, double initial_ub, CCtsp_lpcuts *pool, in CCtsp_init_lp() argument
366 if (!ptour) { in CCtsp_init_lp()
377 (*lp)->perm = ptour; in CCtsp_init_lp()
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/blossom/concorde97/TSP/
H A Dconcorde.c103 int *ptour = (int *) NULL; local
200 if (!ptour) {
201 ptour = CC_SAFE_MALLOC (ncount, int);
202 if (!ptour) {
209 rval = CCutil_getcycle (ncount, tourfname, ptour);
237 rval = CCutil_datagroup_perm (ncount, mydat, ptour);
278 invperm[ptour[i]] = i;
346 rval = CCutil_writemaster (buf, ncount, mydat, ptour);
372 invperm[ptour[i]] = i;
403 ptour, initial_ub, pool);
[all …]
H A Dpoolcat.c60 int *ptour = (int *) NULL; local
78 if (CCutil_getmaster (av[k+1], &ncount, &dat, &ptour)) {
232 pperm[i] = perm[ptour[i]];
235 ptour[i] = pperm[i];
239 rval = CCtsp_file_cuts_write ("merge.txt", pool, ptour);
267 CC_IFFREE (ptour, int);
H A Dbcontrol.c113 CCdatagroup *dat, int *ptour, CCtsp_lpcuts *pool, int ncount, in CCtsp_bfs_brancher() argument
117 usecliques, dat, ptour, pool, ncount, besttour) in CCtsp_bfs_brancher()
126 int *ptour;
170 rval = CCtsp_bb_cutting (probname, bbnode->id, ncount, dat, ptour,
179 rval = CCtsp_dumptour (ncount, dat, ptour, probname, besttour);
199 ptour, upbound, pool, &b, usecliques, &foundtour,
207 rval = CCtsp_dumptour (ncount, dat, ptour, probname, besttour);
217 ptour, *upbound, pool, &b[0], id0, id1, &val0, &val1,
H A Dcontrol.c77 int ncount, CCdatagroup *dat, int *ptour, double upbound,
965 int *ptour, double *upbound, CCtsp_lpcuts *pool, CCtsp_cutselect *sel, in CCtsp_bb_cutting() argument
968 int CCtsp_bb_cutting (probname, probnum, ncount, dat, ptour, upbound, pool, in CCtsp_bb_cutting()
974 int *ptour;
993 rval = bb_cutting_work (&lp, probname, probnum, ncount, dat, ptour,
1124 int ncount, CCdatagroup *dat, int *ptour, double initial_ub, in bb_cutting_work() argument
1127 static int bb_cutting_work (lp, probname, probnum, ncount, dat, ptour, in bb_cutting_work()
1134 int *ptour;
1146 rval = CCtsp_bb_init_lp (lp, probname, probnum, ncount, dat, ptour,
H A Dbranch.c1784 CCdatagroup *dat, int *ptour, double *upperbound, CCtsp_lpcuts *pool, in CCtsp_bb_find_branch() argument
1787 int CCtsp_bb_find_branch (probname, probnum, ncount, dat, ptour, upperbound, in CCtsp_bb_find_branch()
1793 int *ptour;
1811 rval = CCtsp_bb_init_lp (&lp, probname, probnum, ncount, dat, ptour,
1862 CCdatagroup *dat, int *ptour, double initial_ub, CCtsp_lpcuts *pool, in CCtsp_bb_splitprob() argument
1866 int CCtsp_bb_splitprob (probname, probnum, ncount, dat, ptour, initial_ub, in CCtsp_bb_splitprob()
1872 int *ptour;
1889 rval = CCtsp_bb_init_lp (&lp, probname, probnum, ncount, dat, ptour,
1901 rval = CCtsp_bb_init_lp (&lp, probname, probnum, ncount, dat, ptour,
H A Dtsp_lp.c323 CCdatagroup *dat, int *ptour, double initial_ub, CCtsp_lpcuts *pool) in CCtsp_bb_init_lp() argument
325 int CCtsp_bb_init_lp (lp, probname, probnum, ncount, dat, ptour, initial_ub, in CCtsp_bb_init_lp()
332 int *ptour;
341 ptour, initial_ub, pool);
348 int *exlist, int *exlen, int exvalid, int *ptour, in CCtsp_init_lp() argument
352 elist, elen, excount, exlist, exlen, exvalid, ptour, in CCtsp_init_lp()
365 int *ptour;
373 if (!ptour) {
384 (*lp)->perm = ptour;
/dports/math/concorde/concorde/TOOLS/
H A Dttour.c68 int pcount, CCsubdiv *trac, int *ptour),
105 int *ptour = (int *) NULL; in main() local
187 ptour = CC_SAFE_MALLOC (pcount, int); in main()
224 CC_IFFREE (ptour, int); in main()
323 inv[ptour[i]] = i; in insert_crossings()
470 int pcount, CCsubdiv *trac, int *ptour) in find_full_tour() argument
487 printf ("%d ", ptour[i]); in find_full_tour()
504 rval = find_closest_pair (name, ptour[i-1], ptour[i], &n0, &n1, in find_full_tour()
838 int *ptour = (int *) NULL; in find_closest_pair() local
913 CC_SWAP (ptour, qtour, ptempi); in find_closest_pair()
[all …]
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/blossom/concorde97/INCLUDE/
H A Dtsp.h332 CCdatagroup *dat, int *ptour, double *upbound, CCtsp_lpcuts *pool,
338 int exvalid, int *ptour, double initial_ub, CCtsp_lpcuts *pool),
340 int ncount, CCdatagroup *dat, int *ptour, double initial_ub,
371 CCdatagroup *dat, int *ptour, double *upperbound,
383 CCdatagroup *dat, int *ptour, double initial_ub, CCtsp_lpcuts *pool,
393 CCdatagroup *mydat, int *ptour, CCtsp_lpcuts *pool, int ncount,
/dports/math/concorde/concorde/INCLUDE/
H A Dtsp.h534 int *bbcount, int usecliques, CCdatagroup *mydat, int *ptour,
541 CCdatagroup *dat, int *ptour, CCtsp_lpcuts *pool, int ncount,
615 CCdatagroup *dat, int *ptour, double *upperbound, CCtsp_lpcuts *pool,
622 CCdatagroup *dat, int *ptour, double initial_ub, CCtsp_lpcuts *pool,
756 CCdatagroup *dat, int *ptour, double *upbound, CCtsp_lpcuts *pool,
1236 CCdatagroup *dat, int *ptour, double initial_ub, CCtsp_lpcuts *pool,
1241 int exvalid, int *ptour, double initial_ub, CCtsp_lpcuts *pool,
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/blossom/concorde97/
H A Dconcorde.h1886 CCdatagroup *dat, int *ptour, double *upbound, CCtsp_lpcuts *pool,
1892 int exvalid, int *ptour, double initial_ub, CCtsp_lpcuts *pool),
1894 int ncount, CCdatagroup *dat, int *ptour, double initial_ub,
1925 CCdatagroup *dat, int *ptour, double *upperbound,
1937 CCdatagroup *dat, int *ptour, double initial_ub, CCtsp_lpcuts *pool,
1947 CCdatagroup *mydat, int *ptour, CCtsp_lpcuts *pool, int ncount,