Home
last modified time | relevance | path

Searched refs:cur_route_start (Results 1 – 9 of 9) sorted by relevance

/dports/math/disco/DisCO-releases-1.0.0-33-g68720be/examples/VRP/
H A DVrpSolution.cpp29 elist *cur_route_start = NULL; in VrpSolution() local
35 for (cur_route_start = verts[0].first, cur_route = 1, cost = 0, in VrpSolution()
36 edge_data = cur_route_start->data; cur_route <= vrp->numroutes_; in VrpSolution()
38 edge_data = cur_route_start->data; in VrpSolution()
64 while (cur_route_start->data->scanned){ in VrpSolution()
65 if (!(cur_route_start = cur_route_start->next_edge)) break; in VrpSolution()
H A DVrpCutGenerator.cpp304 elist *cur_route_start; in connectivityCuts() local
370 for (cur_route_start = verts[0].first, cur_route = 0, in connectivityCuts()
371 edge_data = cur_route_start->data; cur_route < numroutes; in connectivityCuts()
373 edge_data = cur_route_start->data; in connectivityCuts()
435 while (cur_route_start->data->scanned){/*find the next edge leading out of in connectivityCuts()
439 if (!(cur_route_start = cur_route_start->next_edge)) break; in connectivityCuts()
446 for (cur_route_start = verts[0].first; cur_route_start; in connectivityCuts()
447 cur_route_start = cur_route_start->next_edge) in connectivityCuts()
448 cur_route_start->data->scanned = false; in connectivityCuts()
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/src/CutGen/Decomp/
H A Ddecomp_user.c278 elist *cur_route_start; in user_check_col() local
292 for (cur_route_start = verts[0].first, cur_route = 0, in user_check_col()
293 edge_data = cur_route_start->data; cur_route < vrp->numroutes; in user_check_col()
295 edge_data = cur_route_start->data; in user_check_col()
336 while (cur_route_start->data->scanned){/*find the next edge leading out in user_check_col()
340 if (!(cur_route_start = cur_route_start->next_edge)) break; in user_check_col()
343 for (cur_route_start = verts[0].first; cur_route_start; in user_check_col()
344 cur_route_start = cur_route_start->next_edge) in user_check_col()
345 cur_route_start->data->scanned = FALSE; in user_check_col()
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/CNRP/src/CutGen/
H A Dcnrp_cg.c798 elist *cur_route_start; local
873 edge_data = cur_route_start->data;
950 if (!(cur_route_start = cur_route_start->next_edge)) break;
956 for (cur_route_start = verts[0].first; cur_route_start;
957 cur_route_start = cur_route_start->next_edge)
958 cur_route_start->data->scanned = FALSE;
970 elist *cur_route_start; local
1051 edge_data = cur_route_start->data;
1132 if (!(cur_route_start = cur_route_start->next_edge))
1139 for (cur_route_start = verts[0].first; cur_route_start;
[all …]
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/src/CutGen/
H A Dvrp_cg.c821 elist *cur_route_start; local
882 for (cur_route_start = verts[0].first, cur_route = 0,
883 edge_data = cur_route_start->data; cur_route < numroutes;
885 edge_data = cur_route_start->data;
951 while (cur_route_start->data->scanned){/*find the next edge leading out of
955 if (!(cur_route_start = cur_route_start->next_edge)) break;
961 for (cur_route_start = verts[0].first; cur_route_start;
962 cur_route_start = cur_route_start->next_edge)
963 cur_route_start->data->scanned = FALSE;
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/CNRP/src/Master/
H A Dcnrp_master.c619 elist *cur_route_start = NULL; in user_display_solution() local
733 for (cur_route_start = verts[0].first, cur_route = 1, in user_display_solution()
734 edge_data = cur_route_start->data; cur_route <= cnrp->numroutes; in user_display_solution()
736 edge_data = cur_route_start->data; in user_display_solution()
761 while (cur_route_start->data->scanned){ in user_display_solution()
762 if (!(cur_route_start = cur_route_start->next_edge)) break; in user_display_solution()
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/src/Master/
H A Dvrp_master.c824 elist *cur_route_start = NULL; in user_display_solution() local
835 for (cur_route_start = verts[0].first, cur_route = 1, cost = 0, in user_display_solution()
836 edge_data = cur_route_start->data; cur_route <= vrp->numroutes; in user_display_solution()
838 edge_data = cur_route_start->data; in user_display_solution()
865 while (cur_route_start->data->scanned){ in user_display_solution()
866 if (!(cur_route_start = cur_route_start->next_edge)) break; in user_display_solution()
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/src/LP/
H A Dvrp_lp.c1128 elist *cur_route_start = NULL; local
1134 for (cur_route_start = verts[0].first, cur_route = 1, cost = 0,
1135 edge_data = cur_route_start->data; cur_route <= vrp->numroutes;
1137 edge_data = cur_route_start->data;
1163 while (cur_route_start->data->scanned){
1164 if (!(cur_route_start = cur_route_start->next_edge)) break;
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/CNRP/src/LP/
H A Dcnrp_lp.c1676 elist *cur_route_start = NULL;
1820 for (cur_route_start = verts[0].first, cur_route = 1,
1821 edge_data = cur_route_start->data; cur_route <= cnrp->numroutes;
1823 edge_data = cur_route_start->data;
1848 while (cur_route_start->data->scanned){
1849 if (!(cur_route_start = cur_route_start->next_edge)) break;