assert(probdata !=
NULL);
67assert(graph !=
NULL);
115assert(result !=
NULL);
126assert(sol !=
NULL);
134currnode = &graph->nodes[0];
143assert(currnode->
id== 0);
147 for( i = 0; i <
nnodes; i++ )
163 while( edge !=
NULL)
178finalnode = &graph->nodes[0];
181 while( edge !=
NULL)
183 if( edge->
adjac== finalnode )
204assert(bestedge !=
NULL);
210currnode = bestedge->
adjac;
211assert(currnode !=
NULL);
212assert(0 <= currnode->
id&& currnode->
id<=
nnodes-1);
214assert(!visited[currnode->
id]);
215visited[currnode->
id] =
TRUE;
221 for( i = 0; i <
nnodes; i++ )
222assert(visited[graph->nodes[i].id]);
void capture_graph(GRAPH *gr)
void release_graph(GRAPH **gr)
SCIP_DECL_HEURFREE(HeurFrats::scip_free)
SCIP_DECL_HEURINIT(HeurFrats::scip_init)
SCIP_DECL_HEURINITSOL(HeurFrats::scip_initsol)
SCIP_DECL_HEUREXITSOL(HeurFrats::scip_exitsol)
SCIP_DECL_HEUREXIT(HeurFrats::scip_exit)
SCIP_DECL_HEUREXEC(HeurFrats::scip_exec)
SCIP_DECL_HEURCLONE(scip::ObjCloneable *HeurFrats::clone)
fractional travelling salesman heuristic - Rounding heuristic for TSP
C++ problem data for TSP.
SCIP_Bool SCIPhasCurrentNodeLP(SCIP *scip)
SCIP_LPSOLSTAT SCIPgetLPSolstat(SCIP *scip)
#define SCIPallocBufferArray(scip, ptr, num)
#define SCIPfreeBufferArray(scip, ptr)
SCIP_RETCODE SCIPcreateSol(SCIP *scip, SCIP_SOL **sol, SCIP_HEUR *heur)
SCIP_RETCODE SCIPfreeSol(SCIP *scip, SCIP_SOL **sol)
SCIP_RETCODE SCIPtrySol(SCIP *scip, SCIP_SOL *sol, SCIP_Bool printreason, SCIP_Bool completely, SCIP_Bool checkbounds, SCIP_Bool checkintegrality, SCIP_Bool checklprows, SCIP_Bool *stored)
SCIP_RETCODE SCIPlinkLPSol(SCIP *scip, SCIP_SOL *sol)
SCIP_RETCODE SCIPsetSolVal(SCIP *scip, SCIP_SOL *sol, SCIP_VAR *var, SCIP_Real val)
SCIP_Real SCIPgetSolVal(SCIP *scip, SCIP_SOL *sol, SCIP_VAR *var)
SCIP_Bool SCIPisFeasLE(SCIP *scip, SCIP_Real val1, SCIP_Real val2)
SCIP_Real SCIPvarGetUbGlobal(SCIP_VAR *var)
#define BMSclearMemoryArray(ptr, num)
scip::ObjProbData * SCIPgetObjProbData(SCIP *scip)
struct GraphEdge * first_edge
Definition of base class for all clonable classes.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4