Scippy

SCIP

Solving Constraint Integer Programs

graph.h
Go to the documentation of this file.
1 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
2 /* */
3 /* This file is part of the program and library */
4 /* SCIP --- Solving Constraint Integer Programs */
5 /* */
6 /* Copyright (C) 2002-2022 Konrad-Zuse-Zentrum */
7 /* fuer Informationstechnik Berlin */
8 /* */
9 /* SCIP is distributed under the terms of the ZIB Academic License. */
10 /* */
11 /* You should have received a copy of the ZIB Academic License */
12 /* along with SCIP; see the file COPYING. If not visit scip.zib.de. */
13 /* */
14 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
15 
16 /**@file graph.h
17  * @brief includes various files containing graph methods used for Steiner tree problems
18  * @author Gerald Gamrath
19  * @author Thorsten Koch
20  * @author Daniel Rehfeldt
21  *
22  *
23  */
24 
25 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
26 
27 #ifndef APPLICATIONS_STP_GRAPH_H_
28 #define APPLICATIONS_STP_GRAPH_H_
29 
30 #include "scip/scip.h"
31 #include "misc_stp.h"
32 #include "graphdefs.h"
33 #include "redcosts.h"
34 #include "reducedefs.h"
35 #include "portab.h"
36 #include "stpvector.h"
37 
38 
39 #ifdef __cplusplus
40 extern "C" {
41 #endif
42 
43 
44 //#define STP_RPC_FIXEDPROPER // only for testing
45 
46 
47 
48 /* graph_history.c
49  */
50 extern SCIP_RETCODE graph_initContractTracing(SCIP*, GRAPH*);
51 extern int graph_contractTrace(int, const GRAPH*);
52 extern SCIP_Bool graph_knot_hasContractTrace(int, const GRAPH*);
53 extern void graph_fixed_resetMoved(GRAPH*);
54 extern SCIP_RETCODE graph_singletonAncestors_init(SCIP*, const GRAPH*, int, SINGLETONANS*);
55 extern void graph_singletonAncestors_freeMembers(SCIP*, SINGLETONANS*);
56 extern SCIP_Bool graph_valid_ancestors(SCIP*, const GRAPH*);
57 extern SCIP_RETCODE graph_initAncestors(SCIP*, GRAPH*);
58 /* Pseudo ancestors */
59 extern SCIP_RETCODE graph_initPseudoAncestors(SCIP*, GRAPH*);
60 extern SCIP_RETCODE graph_initPseudoAncestorsSized(SCIP*, int, GRAPH*);
61 extern void graph_freePseudoAncestors(SCIP*, GRAPH*);
62 extern void graph_edge_delPseudoAncestors(SCIP*, int, GRAPH*);
63 extern void graph_knot_delPseudoAncestors(SCIP*, int, GRAPH*);
64 extern void graph_edge_printPseudoAncestors(const GRAPH*, int);
65 extern void graph_knot_printPseudoAncestors(const GRAPH*, int);
66 extern int graph_edge_nPseudoAncestors(const GRAPH*, int);
67 extern int graph_knot_nPseudoAncestors(const GRAPH*, int);
68 extern const int* graph_edge_getPseudoAncestors(const GRAPH*, int);
69 extern IDX* graph_edge_getAncestors(const GRAPH*, int);
70 extern const int* graph_knot_getPseudoAncestors(const GRAPH*, int);
71 extern int graph_getNpseudoAncestors(const GRAPH*);
72 extern void graph_addPseudoAncestor(GRAPH*, int*);
73 extern void graph_addPseudoAncestors(int, GRAPH*);
74 extern SCIP_RETCODE graph_pseudoAncestors_appendCopyEdge(SCIP*, int, int, SCIP_Bool, GRAPH*, SCIP_Bool*);
75 extern SCIP_RETCODE graph_pseudoAncestors_appendCopyNode(SCIP*, int, int, SCIP_Bool, GRAPH*, SCIP_Bool*);
76 extern SCIP_RETCODE graph_pseudoAncestors_appendCopyNodeToEdge(SCIP*, int, int, SCIP_Bool, GRAPH*, SCIP_Bool*);
77 extern SCIP_RETCODE graph_pseudoAncestors_appendCopyEdgeToNode(SCIP*, int, int, SCIP_Bool, GRAPH*, SCIP_Bool*);
78 extern SCIP_RETCODE graph_pseudoAncestors_appendCopySingToEdge(SCIP*, int, const SINGLETONANS*, SCIP_Bool, GRAPH*, SCIP_Bool*);
79 extern SCIP_RETCODE graph_pseudoAncestors_appendCopyArrayToEdge(SCIP*, int, const int*, int, GRAPH*, SCIP_Bool*);
80 extern SCIP_RETCODE graph_pseudoAncestors_appendMoveEdge(SCIP*, int, int, SCIP_Bool, GRAPH*, SCIP_Bool*);
81 extern SCIP_RETCODE graph_pseudoAncestors_appendMoveNode(SCIP*, int, int, SCIP_Bool, GRAPH*, SCIP_Bool*);
82 extern SCIP_RETCODE graph_pseudoAncestors_addToEdge(SCIP*, int, int, GRAPH*);
83 extern SCIP_RETCODE graph_pseudoAncestors_addToNode(SCIP*, int, int, GRAPH*);
84 extern SCIP_RETCODE graph_free_pseudoAncestorsBlock(SCIP*, int, GRAPH*);
85 //extern SCIP_RETCODE graph_checkConflict1_pseudoAncestors(SCIP*, const GRAPH*, int, SCIP_Bool*);
86 extern int graph_pseudoAncestorsGetHashArraySize(const PSEUDOANS*);
87 extern void graph_pseudoAncestors_hashNode(const PSEUDOANS*, int, int*);
88 extern void graph_pseudoAncestors_hashEdge(const PSEUDOANS*, int, int*);
89 extern void graph_pseudoAncestors_unhashNode(const PSEUDOANS*, int, int*);
90 extern void graph_pseudoAncestors_unhashEdge(const PSEUDOANS*, int, int*);
91 extern void graph_pseudoAncestors_hashNodeDirty(const PSEUDOANS*, int, SCIP_Bool, SCIP_Bool*, int*);
92 extern void graph_pseudoAncestors_hashEdgeDirty(const PSEUDOANS*, int, SCIP_Bool, SCIP_Bool*, int*);
93 extern void graph_pseudoAncestors_unhashNodeDirty(const PSEUDOANS*, int, int*);
94 extern void graph_pseudoAncestors_unhashEdgeDirty(const PSEUDOANS*, int, int*);
95 extern SCIP_Bool graph_pseudoAncestors_edgeIsHashed(const PSEUDOANS*, int, const int*);
96 extern SCIP_Bool graph_pseudoAncestors_nodeIsHashed(const PSEUDOANS*, int, const int*);
97 extern SCIP_Bool graph_pseudoAncestors_edgesInConflict(SCIP*, const GRAPH*, const int*, int);
98 extern SCIP_Bool graph_valid_pseudoAncestors(SCIP*, const GRAPH*);
99 /* Fixed components */
100 extern SCIP_RETCODE graph_init_fixed(SCIP*, GRAPH*);
101 extern void graph_free_fixed(SCIP*, GRAPH*);
102 extern void graph_free_fixedEdgesOnly(SCIP*, GRAPH*);
103 extern SCIP_RETCODE graph_fixed_add(SCIP*, IDX*, const int*, int, GRAPH*);
104 extern SCIP_RETCODE graph_fixed_addEdge(SCIP*, int, GRAPH*);
105 extern SCIP_RETCODE graph_fixed_addNodePc(SCIP*, int, GRAPH*);
106 extern SCIP_RETCODE graph_fixed_moveNodePc(SCIP*, int, GRAPH*);
107 extern SCIP_RETCODE graph_copyFixed(SCIP*, GRAPH*, SCIP_Bool, GRAPH*);
108 extern IDX* graph_getFixedges(const GRAPH*);
109 extern const int* graph_getFixpseudonodes(SCIP*, const GRAPH*);
110 extern int graph_getNfixpseudonodes(const GRAPH*);
111 
112 /* graph_util.c
113  */
114 extern SCIP_RETCODE graph_termsReachable(SCIP*, const GRAPH*, SCIP_Bool*);
115 extern SCIP_RETCODE graph_findCentralTerminal(SCIP*, const GRAPH*, int, int*);
116 extern SCIP_RETCODE graph_trail_arr(SCIP*, const GRAPH*, int, SCIP_Bool*);
117 extern SCIP_RETCODE graph_trail_costAware(SCIP*, const GRAPH*, int, SCIP_Bool*);
118 /* Dijkstra heap: */
119 extern SCIP_RETCODE graph_heap_create(SCIP*, int, int*, DENTRY*, DHEAP**);
120 extern void graph_heap_free(SCIP*, SCIP_Bool, SCIP_Bool, DHEAP**);
121 extern void graph_heap_deleteMin(int*, SCIP_Real*, DHEAP*);
122 extern void graph_heap_deleteMinGetNode(int*, DHEAP*);
123 extern int graph_heap_deleteMinReturnNode(DHEAP*);
124 extern void graph_heap_clean(SCIP_Bool, DHEAP*);
125 extern void graph_heap_correct(int, SCIP_Real, DHEAP*);
126 extern SCIP_Bool graph_heap_isClean(const DHEAP*);
127 /* CSR storage: */
128 extern SCIP_RETCODE graph_init_csr(SCIP*, GRAPH*);
129 extern SCIP_RETCODE graph_init_csrWithEdgeId(SCIP*, GRAPH*);
130 extern void graph_free_csr(SCIP*, GRAPH*);
131 extern SCIP_RETCODE graph_csr_alloc(SCIP*, int, int, CSR**);
132 extern SCIP_RETCODE graph_csr_allocWithEdgeId(SCIP*, int, int, CSR**);
133 extern void graph_csr_copy(const CSR*, CSR*);
134 extern void graph_csr_build(const GRAPH*, const SCIP_Real*, CSR*);
135 extern void graph_csr_buildCosts(const GRAPH*, const CSR*, const SCIP_Real*, SCIP_Real* RESTRICT);
136 extern void graph_csr_chgCosts(const GRAPH*, const SCIP_Real*, CSR*);
137 extern void graph_csr_print(const CSR*);
138 extern int graph_csr_getNedges(const CSR*);
139 extern void graph_csr_free(SCIP*, CSR**);
140 extern SCIP_Bool graph_csr_costsAreInSync(const GRAPH*, const CSR*, const SCIP_Real*);
141 extern SCIP_Bool graph_csr_isValid(const CSR*, SCIP_Bool verbose);
142 extern SCIP_Bool graph_valid_csr(const GRAPH*, SCIP_Bool verbose);
143 extern void graph_buildOrgNodesToReducedMap(const GRAPH*, int*);
144 /* CSR depository: */
145 extern SCIP_RETCODE graph_csrdepo_init(SCIP*, int, int, CSRDEPO**);
146 extern void graph_csrdepo_free(SCIP*, CSRDEPO**);
147 extern void graph_csrdepo_print(const CSRDEPO*);
148 extern void graph_csrdepo_getCSR(const CSRDEPO*, int, CSR*);
149 extern void graph_csrdepo_getTopCSR(const CSRDEPO*, CSR*);
150 extern int graph_csrdepo_getNcsrs(const CSRDEPO*);
151 extern int graph_csrdepo_getDataSize(const CSRDEPO*);
152 extern void graph_csrdepo_clean(CSRDEPO*);
153 extern void graph_csrdepo_removeTop(CSRDEPO*);
154 extern void graph_csrdepo_addEmptyTop(CSRDEPO*, int, int);
155 extern void graph_csrdepo_addEmptyTopTree(CSRDEPO*, int);
156 extern SCIP_Bool graph_csrdepo_isEmpty(const CSRDEPO*);
157 extern SCIP_Bool graph_csrdepo_hasEmptyTop(const CSRDEPO*);
158 extern void graph_csrdepo_getEmptyTop(const CSRDEPO*, CSR*);
159 extern void graph_csrdepo_emptyTopSetMarked(CSRDEPO*);
160 
161 /* Dynamic CSR storage: */
162 extern SCIP_RETCODE graph_init_dcsr(SCIP*, GRAPH*);
163 extern void graph_update_dcsr(SCIP*, GRAPH*);
164 extern void graph_dcsr_deleteEdge(DCSR*, int, int);
165 extern void graph_dcsr_deleteEdgeBi(SCIP*, DCSR*, int);
166 extern void graph_free_dcsr(SCIP*, GRAPH*);
167 extern SCIP_Bool graph_valid_dcsr(const GRAPH*, SCIP_Bool verbose);
168 /* misc: */
169 extern SCIP_RETCODE graph_dijkLimited_init(SCIP*, const GRAPH*, DIJK**);
170 extern SCIP_RETCODE graph_dijkLimited_initPcShifts(SCIP*, const GRAPH*, DIJK*);
171 extern void graph_dijkLimited_reset(const GRAPH*, DIJK*);
172 extern void graph_dijkLimited_clean(const GRAPH*, DIJK*);
173 extern void graph_dijkLimited_free(SCIP*, DIJK**);
174 
175 /* graph_base.c
176  */
177 extern void graph_mark(GRAPH*);
178 extern void graph_show(const GRAPH*);
179 extern void graph_uncover(GRAPH*);
180 extern void graph_free(SCIP*, GRAPH**, SCIP_Bool);
181 extern void graph_freeHistory(SCIP*, GRAPH*);
182 extern void graph_freeHistoryDeep(SCIP*, GRAPH*);
183 extern void graph_getIsTermArray(const GRAPH*, SCIP_Bool*);
184 extern void graph_getTerms(const GRAPH*, int*);
185 extern SCIP_RETCODE graph_getTermsRandom(SCIP*, const GRAPH*, int*);
186 extern void graph_getEdgeCosts(const GRAPH*, SCIP_Real* RESTRICT, SCIP_Real* RESTRICT);
187 extern void graph_getEdgeRevCosts(const GRAPH*, SCIP_Real* RESTRICT);
188 extern void graph_getCsr(const GRAPH*, int* RESTRICT, int* RESTRICT, int* RESTRICT, int*);
189 extern SCIP_RETCODE graph_resize(SCIP*, GRAPH*, int, int, int);
190 extern SCIP_RETCODE graph_copy(SCIP*, const GRAPH*, GRAPH**);
191 extern SCIP_RETCODE graph_copyPseudoAncestors(SCIP*, const GRAPH*, GRAPH*);
192 extern SCIP_RETCODE graph_copyData(SCIP*, const GRAPH*, GRAPH*);
193 extern SCIP_RETCODE graph_pack(SCIP*, GRAPH*, GRAPH**, REDSOL*, SCIP_Bool);
194 extern SCIP_RETCODE graph_init(SCIP*, GRAPH**, int, int, int);
195 extern SCIP_RETCODE graph_initHistory(SCIP*, GRAPH*);
196 extern SCIP_Bool graph_isMarked(const GRAPH*);
197 extern SCIP_Bool graph_isSetUp(const GRAPH*);
198 extern SCIP_RETCODE graph_buildCompleteGraph(SCIP*, GRAPH**, int);
199 extern SCIP_Bool graph_valid(SCIP*, const GRAPH*);
200 extern SCIP_Bool graph_validInput(SCIP*, const GRAPH*);
201 extern SCIP_Bool graph_knotIsNWLeaf(const GRAPH*, int);
202 
203 /* graph_sub.c
204  */
205 extern SCIP_RETCODE graph_subgraphExtract(SCIP*, GRAPH*, SUBINOUT*, GRAPH**);
206 extern SCIP_RETCODE graph_subinoutInit(SCIP*, const GRAPH*, SUBINOUT**);
207 extern void graph_subinoutFree(SCIP*, SUBINOUT**);
208 extern void graph_subinoutClean(SCIP*, SUBINOUT*);
209 extern SCIP_Bool graph_subinoutUsesNewHistory(const SUBINOUT*);
210 extern SCIP_RETCODE graph_subinoutActivateEdgeMap(const GRAPH*, SUBINOUT*);
211 extern void graph_subinoutActivateNewHistory(SUBINOUT*);
212 const int* graph_subinoutGetSubToOrgEdgeMap(const SUBINOUT*);
213 const int* graph_subinoutGetSubToOrgNodeMap(const SUBINOUT*);
214 const int* graph_subinoutGetOrgToSubNodeMap(const SUBINOUT*);
215 const int* graph_subinoutGetContractionRecord(const SUBINOUT*);
216 int graph_knot_getContractionRecordAncestor(int, const SUBINOUT*);
217 extern SCIP_RETCODE graph_subgraphCompleteNewHistory(SCIP*, const int*, GRAPH*, GRAPH*);
218 extern SCIP_RETCODE graph_subgraphReinsert(SCIP*, SUBINOUT*, GRAPH*, GRAPH**);
219 extern void graph_subgraphFree(SCIP*, GRAPH**);
220 
221 /* graph_grid.c
222  */
223 extern SCIP_RETCODE graph_grid_create(SCIP*, GRAPH**, int**, int, int, int);
224 extern SCIP_RETCODE graph_obstgrid_create(SCIP*, GRAPH**, int**, int**, int, int, int, int);
225 extern SCIP_RETCODE graph_grid_coordinates(SCIP*, int**, int**, int*, int, int);
226 
227 /* graph_edge.c
228  */
229 extern void graph_edge_add(SCIP*, GRAPH*, int, int, double, double);
230 extern void graph_edge_addBi(SCIP*, GRAPH*, int, int, double);
231 extern void graph_edge_addSubgraph(SCIP*, const GRAPH*, const int*, int, GRAPH*);
232 extern void graph_edge_del(SCIP*, GRAPH*, int, SCIP_Bool);
233 extern void graph_edge_delFull(SCIP*, GRAPH*, int, SCIP_Bool);
234 extern void graph_edge_delBlocked(SCIP*, GRAPH*, const SCIP_Bool*, SCIP_Bool);
235 extern void graph_edge_delHistory(SCIP*, GRAPH*, int);
236 extern void graph_edge_hide(GRAPH*, int);
237 extern int graph_edge_redirect(SCIP*, GRAPH*, int, int, int, SCIP_Real, SCIP_Bool, SCIP_Bool);
238 
239 /* graph_node.c
240  */
241 extern SCIP_RETCODE graph_knot_contract(SCIP*, GRAPH*, int*, int, int);
242 extern SCIP_RETCODE graph_knot_contractFixed(SCIP*, GRAPH*, int*, int, int, int);
243 extern SCIP_RETCODE graph_knot_contractLowdeg2High(SCIP*, GRAPH*, int*, int, int);
244 extern SCIP_RETCODE graph_knot_replaceDeg2(SCIP*, int, SCIP_Real, int, GRAPH*, SCIP_Bool*);
245 extern SCIP_RETCODE graph_edge_reinsert(SCIP*, GRAPH*, int, int, int, SCIP_Real, int, SINGLETONANS*, SINGLETONANS*, int*, SCIP_Bool*);
246 extern SCIP_Bool graph_knot_isInRange(const GRAPH*, int);
247 extern void graph_knot_add(GRAPH*, int);
248 extern void graph_knot_chg(GRAPH*, int, int);
249 extern void graph_knot_del(SCIP*, GRAPH*, int, SCIP_Bool);
250 extern void graph_knot_delFull(SCIP*, GRAPH*, int, SCIP_Bool);
251 extern void graph_knot_contract_dir(GRAPH*, int, int);
252 
253 /* graph_delpseudo.c
254  */
255 extern SCIP_RETCODE graph_edge_delPseudo(SCIP*, GRAPH*, const SCIP_Real*, const SCIP_Real*, const SCIP_Real*, int, SCIP_Real*, SCIP_Bool*);
256 extern SCIP_RETCODE graph_edge_delPseudoPath(SCIP*, GRAPH*, int, int, int, SCIP_Real*);
257 extern SCIP_RETCODE graph_knot_delPseudo(SCIP*, GRAPH*, const SCIP_Real*, const SCIP_Real*, const SCIP_Real*, int, REDCOST*, SCIP_Bool*);
258 extern SCIP_RETCODE graph_knot_delPseudoCheckIfPossible(SCIP*, const GRAPH*, const SCIP_Real*, const SCIP_Real*, const SCIP_Real*, int, SCIP_Bool*);
259 
260 /* graph_stats.c
261  */
262 extern SCIP_RETCODE graph_printEdgeConflicts(SCIP*, const GRAPH*);
263 extern void graph_edge_printInfo(const GRAPH*, int);
264 extern SCIP_Bool graph_edge_isBlocked(const GRAPH*, int);
265 extern SCIP_Bool graph_edge_isDeleted(const GRAPH*, int);
266 extern SCIP_Bool graph_edge_isInRange(const GRAPH*, int);
267 extern SCIP_Bool graph_hasMultiEdges(SCIP*, const GRAPH*, SCIP_Bool);
268 extern SCIP_Bool graph_isAlmostUniform(const GRAPH*);
269 extern void graph_knot_printInfo(const GRAPH*, int);
270 extern void graph_printInfo(const GRAPH*);
271 extern void graph_printInfoReduced(const GRAPH*);
272 extern int graph_get_nNodes(const GRAPH*);
273 extern int graph_get_nEdges(const GRAPH*);
274 extern int graph_get_nTerms(const GRAPH*);
275 extern void graph_get_nVET(const GRAPH*, int*, int*, int*);
276 extern SCIP_Real graph_get_avgDeg(const GRAPH*);
277 extern SCIP_Bool graph_typeIsSpgLike(const GRAPH*);
278 extern SCIP_Bool graph_typeIsUndirected(const GRAPH*);
279 extern SCIP_Bool graph_typeIsDirected(const GRAPH*);
280 
281 
282 /* graph_trans.c
283  */
284 extern SCIP_RETCODE graph_transNw(SCIP*, PRESOL*, GRAPH*);
285 extern SCIP_RETCODE graph_transNw2sap(SCIP*, PRESOL*, GRAPH*);
286 extern SCIP_RETCODE graph_transNw2pc(SCIP*, PRESOL*, GRAPH*);
287 extern void graph_transGstpClean(PRESOL*, GRAPH*);
288 extern SCIP_RETCODE graph_transPc(SCIP*, GRAPH*);
289 extern SCIP_RETCODE graph_transPc2Spg(SCIP*, PRESOL*, GRAPH*);
290 extern SCIP_RETCODE graph_transRpc(SCIP*, GRAPH*);
291 extern SCIP_RETCODE graph_transRpc2SpgTrivial(SCIP*, GRAPH*);
292 extern SCIP_RETCODE graph_transRpc2FixedProper(SCIP*, PRESOL*, GRAPH*);
293 extern SCIP_RETCODE graph_transMw(SCIP*, GRAPH*);
294 extern SCIP_RETCODE graph_transRmw(SCIP*, GRAPH*);
295 extern SCIP_RETCODE graph_transPcmw2rooted(SCIP*, GRAPH*, SCIP_Real, SCIP_Bool);
296 extern SCIP_RETCODE graph_transPcGetSap(SCIP*, GRAPH*, GRAPH**, SCIP_Real*);
297 extern SCIP_RETCODE graph_transPcGetRsap(SCIP*, GRAPH*, GRAPH**, const int*, int, int);
298 extern SCIP_RETCODE graph_transRpcGetSpg(SCIP*, const GRAPH*, SCIP_Real, SCIP_Real*, int**, GRAPH**);
299 extern SCIP_Bool graph_transRpcToSpgIsStable(const GRAPH*, SCIP_Real);
300 
301 
302 /* graph_pcbase.c
303  */
304 extern void graph_pc_knotToNonTermProperty(GRAPH*, int);
305 extern void graph_pc_knotToFixedTermProperty(GRAPH*, int);
306 extern void graph_pc_termToNonLeafTerm(SCIP*, GRAPH*, int, SCIP_Bool);
307 extern void graph_pc_termToNonTerm(SCIP*, GRAPH*, int);
308 extern void graph_pc_fixedTermToNonTerm(SCIP*, GRAPH*, int);
309 extern void graph_pc_knotToFixedTerm(SCIP*, GRAPH*, int, SCIP_Real*);
310 extern void graph_pc_nonTermToFixedTerm(GRAPH*, int, SCIP_Real*);
311 extern void graph_pc_updateSubgraphEdge(const GRAPH*, const int*, int, GRAPH*);
312 extern void graph_pc_enforcePseudoTerm(SCIP*, GRAPH*, int);
313 extern void graph_pc_enforceNonLeafTerm(SCIP*, GRAPH*, int);
314 extern SCIP_Bool graph_pc_nonLeafTermIsEnforced(SCIP*, const GRAPH*, int);
315 extern void graph_pc_enforceNode(SCIP*, GRAPH*, int, SCIP_Real*);
316 extern void graph_pc_subtractPrize(SCIP*, GRAPH*, SCIP_Real, int);
317 extern void graph_pc_knotChgPrize(GRAPH*, SCIP_Real, int);
318 extern void graph_pc_2org(SCIP*, GRAPH*);
319 extern void graph_pc_2trans(SCIP*, GRAPH*);
320 extern void graph_pc_2orgcheck(SCIP*, GRAPH*);
321 extern void graph_pc_2transcheck(SCIP*, GRAPH*);
322 extern int graph_pc_getNorgEdges(const GRAPH*);
323 extern void graph_pc_getReductionRatios(const GRAPH*, SCIP_Real*, SCIP_Real*);
324 extern void graph_pc_getOrgCosts(SCIP*, const GRAPH*, SCIP_Real*);
325 extern void graph_pc_getOrgCostsCsr(SCIP*, const GRAPH*, CSR*);
326 extern void graph_pc_markOrgGraph(GRAPH*);
327 extern void graph_pc_adaptSap(SCIP_Real, GRAPH*, SCIP_Real*);
328 extern void graph_pc_presolExit(SCIP*, GRAPH*);
329 extern void graph_pc_getBiased(const GRAPH*, SCIP_Real* RESTRICT, SCIP_Real* RESTRICT);
330 extern void graph_pc_termMarkProper(const GRAPH*, int*);
331 extern void graph_pc_shiftNonLeafCosts(SCIP*, GRAPH*);
332 extern SCIP_Real graph_pc_getNonLeafTermOffset(SCIP*, const GRAPH*);
333 extern SCIP_RETCODE graph_pc_presolInit(SCIP*, GRAPH*);
334 extern SCIP_RETCODE graph_pc_initSubgraph(SCIP*, GRAPH*);
335 extern SCIP_RETCODE graph_pc_finalizeSubgraph(SCIP*, GRAPH*);
336 extern SCIP_RETCODE graph_pc_initPrizes(SCIP*, GRAPH*, int);
337 extern SCIP_RETCODE graph_pc_initTerm2Edge(SCIP*, GRAPH*, int);
338 extern SCIP_RETCODE graph_pc_contractNodeAncestors(SCIP*, GRAPH*, int, int, int);
339 extern SCIP_RETCODE graph_pc_contractEdge(SCIP*, GRAPH*, int*, int, int, int);
340 extern SCIP_RETCODE graph_pc_contractEdgeUnordered(SCIP*, GRAPH*, int*, int, int);
341 extern int graph_pc_deleteTerm(SCIP*, GRAPH*, int, SCIP_Real*);
342 extern int graph_pc_realDegree(const GRAPH*, int, SCIP_Bool);
343 extern int graph_pc_getRoot2PtermEdge(const GRAPH*, int);
344 extern int graph_pc_nFixedTerms(const GRAPH*);
345 extern int graph_pc_nNonFixedTerms(const GRAPH*);
346 extern int graph_pc_nProperPotentialTerms(const GRAPH*);
347 extern int graph_pc_nNonLeafTerms(const GRAPH*);
348 extern int graph_pc_getTwinTerm(const GRAPH*, int);
349 extern SCIP_Bool graph_pc_costsEqualOrgCosts(SCIP*, const GRAPH*, const SCIP_Real*);
350 extern SCIP_Bool graph_pc_edgeIsExtended(const GRAPH*, int);
351 extern SCIP_Bool graph_pc_knotIsFixedTerm(const GRAPH*, int);
352 extern SCIP_Bool graph_pc_knotIsPropPotTerm(const GRAPH*, int);
353 extern SCIP_Bool graph_pc_knotHasMaxPrize(const GRAPH*, int);
354 extern SCIP_Bool graph_pc_knotIsDummyTerm(const GRAPH*, int);
355 extern SCIP_Bool graph_pc_termIsNonLeafTerm(const GRAPH*, int);
356 extern SCIP_Bool graph_pc_knotIsNonLeafTerm(const GRAPH*, int);
357 extern SCIP_Bool graph_pc_evalTermIsNonLeaf(SCIP*, const GRAPH*, int);
358 extern SCIP_Bool graph_pc_term2edgeIsConsistent(SCIP*, const GRAPH*);
359 extern SCIP_Bool graph_pc_transOrgAreConistent(SCIP*, const GRAPH*, SCIP_Bool);
360 extern SCIP_Real graph_pc_getPosPrizeSum(SCIP*, const GRAPH*);
361 extern SCIP_Bool graph_pc_isPc(const GRAPH*);
362 extern SCIP_Bool graph_pc_isMw(const GRAPH*);
363 extern SCIP_Bool graph_pc_isPcMw(const GRAPH*);
364 extern SCIP_Bool graph_pc_isRootedPcMw(const GRAPH*);
365 extern SCIP_Bool graph_pc_isUnrootedPcMw(const GRAPH*);
366 extern SCIP_Real graph_pc_solGetObj(SCIP*, const GRAPH*, const int*, SCIP_Real);
367 
368 
369 /* graph_path.c
370  */
371 extern void graph_path_exit(SCIP*, GRAPH*);
372 extern void graph_path_exec(SCIP*, const GRAPH*, int, int, const SCIP_Real*, PATH*);
373 extern void graph_pathInLimitedExec(const GRAPH*, const SCIP_Real*, const SCIP_Bool*, int, DIJK*, SCIP_Real*);
374 extern void graph_path_execX(SCIP*, const GRAPH*, int, const SCIP_Real*, SCIP_Real*, int*);
375 extern void graph_path_invroot(SCIP*, const GRAPH*, int, const SCIP_Real*, SCIP_Real*, int*);
376 extern void graph_path_st(const GRAPH*, const SCIP_Real*, SCIP_Real*, int*, int, STP_Bool*);
377 extern SCIP_RETCODE graph_path_st_dc(SCIP*, const GRAPH*, const SCIP_Real*, SCIP_Real*, int*, int, STP_Bool*, int*, STP_Bool*);
378 extern void graph_path_st_rpcmw(GRAPH*, SCIP_Real*, int*, const SCIP_Real*, const SCIP_Real*, SCIP_Real*, int*, int, STP_Bool*);
379 extern SCIP_RETCODE graph_path_st_brmwcs(SCIP*, GRAPH*, const SCIP_Real*, SCIP_Real*, int*, int, STP_Bool*, SCIP_Bool*);
380 extern void graph_path_st_pcmw(GRAPH*, SCIP_Real*, int*, const SCIP_Real*, const SCIP_Real*, SCIP_Bool, SCIP_Real*, int*, int, STP_Bool*);
381 extern void graph_path_st_pcmw_full(GRAPH*, const SCIP_Real*, SCIP_Real*, int*, int, STP_Bool*);
382 extern void graph_path_st_pcmw_reduce(SCIP*, const GRAPH*, const SCIP_Real*, SCIP_Real*, int*, int, STP_Bool*);
383 extern void graph_path_st_pcmw_extend(SCIP*, const GRAPH*, const SCIP_Real*, SCIP_Bool, PATH*, STP_Bool*, SCIP_Bool*);
384 extern void graph_path_st_pcmw_extendBiased(SCIP*, GRAPH*, const SCIP_Real*, const SCIP_Real*, PATH*, STP_Bool*, SCIP_Bool*);
385 extern void graph_path_st_pcmw_extendOut(SCIP*, const GRAPH*, int, STP_Bool*, SCIP_Real*, int*, STP_Bool*, DHEAP*, SCIP_Bool*);
386 extern void graph_pathHeapAdd(const PATH*, int, int* RESTRICT, int* RESTRICT, int*);
387 extern void graph_path_PcMwSd(SCIP*, const GRAPH*, PATH*, SCIP_Real*, SCIP_Real, int*, int*, int*, int*, int*, int*, int, int, int);
388 extern SCIP_RETCODE graph_path_init(SCIP*, GRAPH*);
389 extern SCIP_Bool graph_path_exists(const GRAPH*);
390 extern void graph_sdPaths(const GRAPH*, PATH*, const SCIP_Real*, SCIP_Real, int*, int*, int*, int*, int, int, int);
391 
392 /* graph_tpath.c
393  */
394 extern void graph_add2ndTermPaths(const GRAPH*, const SCIP_Real*, const SCIP_Real*, PATH*, int*, int*);
395 extern void graph_add3rdTermPaths(const GRAPH*, const SCIP_Real*, const SCIP_Real*, PATH*, int*, int*);
396 extern void graph_add4thTermPaths(const GRAPH*, const SCIP_Real*, const SCIP_Real*, PATH*, int*, int*);
397 extern void graph_get2nextTermPaths(GRAPH*, const SCIP_Real*, const SCIP_Real*, PATH*, int*, int*);
398 extern void graph_get3nextTermPaths(GRAPH*, const SCIP_Real*, const SCIP_Real*, PATH*, int*, int*);
399 extern void graph_get4nextTermPaths(GRAPH*, const SCIP_Real*, const SCIP_Real*, PATH*, int*, int*);
400 extern SCIP_RETCODE graph_get4nextTTerms(SCIP*, GRAPH*, const SCIP_Real*, PATH*, int*, int*, int*);
401 extern SCIP_RETCODE graph_tpathsInit(SCIP*, GRAPH*, TPATHS**);
402 extern SCIP_RETCODE graph_tpathsInitBiased(SCIP*, const SDPROFIT*, GRAPH*, TPATHS**);
403 extern SCIP_RETCODE graph_tpathsRecomputeBiased(const SDPROFIT*, GRAPH*, TPATHS*);
404 extern SCIP_RETCODE graph_tpathsRepair(SCIP*, int, SCIP_Bool, const GRAPH*, TPATHS*);
405 extern SCIP_RETCODE graph_tpathsRepairSetUp(const GRAPH*, TPATHS*);
406 extern void graph_tpathsFree(SCIP*, TPATHS**);
407 extern void graph_tpathsPrintForNode(const GRAPH*, const SDPROFIT*, const TPATHS*, int);
408 extern void graph_tpathsGetProfitNodes(SCIP*, const GRAPH*, const TPATHS*, const SDPROFIT*, int, int, STP_Vectype(int));
409 extern void graph_tpathsAdd1st(const GRAPH*, const SCIP_Real*, const SDPROFIT*, TPATHS*);
410 extern void graph_tpathsAdd2nd(const GRAPH*, const SCIP_Real*, const SCIP_Real*, const SDPROFIT*, TPATHS*);
411 extern void graph_tpathsAdd3rd(const GRAPH*, const SCIP_Real*, const SCIP_Real*, const SDPROFIT*, TPATHS*);
412 extern void graph_tpathsAdd4th(const GRAPH*, const SCIP_Real*, const SCIP_Real*, const SDPROFIT*, TPATHS*);
413 extern void graph_tpathsSetAll2(GRAPH*, const SCIP_Real*, const SCIP_Real*, const SDPROFIT*, TPATHS*);
414 extern void graph_tpathsSetAll3(GRAPH*, const SCIP_Real*, const SCIP_Real*, const SDPROFIT*, TPATHS*);
415 extern void graph_tpathsSetAll4(GRAPH*, const SCIP_Real*, const SCIP_Real*, const SDPROFIT*, TPATHS*);
416 extern void graph_tpathsGetClosestTerm(const GRAPH*, const TPATHS*, int,
417  int* RESTRICT, int* RESTRICT, SCIP_Real* RESTRICT);
418 extern void graph_tpathsGet3CloseTerms(const GRAPH*, const TPATHS*, int, SCIP_Real,
419  int* RESTRICT, int* RESTRICT, SCIP_Real* RESTRICT, int* RESTRICT);
420 extern void graph_tpathsGet4CloseTerms(const GRAPH*, const TPATHS*, int, SCIP_Real,
421  int* RESTRICT, int* RESTRICT, SCIP_Real* RESTRICT, int* RESTRICT);
422 extern void graph_tpathsGet4CloseTermsLE(const GRAPH*, const TPATHS*, int, SCIP_Real,
423  int* RESTRICT, int* RESTRICT, SCIP_Real* RESTRICT, int* RESTRICT);
424 
425 /* graph_sdpath.c
426  */
427 extern void graph_sdStar(SCIP*, const GRAPH*, SCIP_Bool, int, int, int*, SCIP_Real*, int*, int*, DHEAP*, STP_Bool*, SCIP_Bool*);
428 extern SCIP_RETCODE graph_sdStarBiased(SCIP*, const GRAPH*, const SDPROFIT*, int, int*, DIJK*, SCIP_Bool*);
429 extern SCIP_RETCODE graph_sdCloseNodesBiased(SCIP*, const GRAPH*, const SDPROFIT*, int, DIJK*);
430 extern SCIP_Bool graph_sdWalksConnected(SCIP*, const GRAPH*, const int*, const SCIP_Real*, const STP_Bool*, int, int, SCIP_Real*, int*, int*, STP_Bool*, SCIP_Bool);
431 extern SCIP_Bool graph_sdWalks(SCIP*, const GRAPH*, const SCIP_Real*, const int*, SCIP_Real, int, int, int, SCIP_Real*, int*, int*, int*, int*, STP_Bool*);
432 extern SCIP_Bool graph_sdWalks_csr(SCIP*, const GRAPH*, const int*, SCIP_Real, int, int, int, SCIP_Real*, int*, int*, DHEAP*, STP_Bool*);
433 extern SCIP_Bool graph_sdWalksTriangle(SCIP*, const GRAPH*, const int*, const int*, SCIP_Real, int, int, int, SCIP_Real*, SCIP_Real*, int*, int*, DHEAP*, STP_Bool*);
434 extern SCIP_Bool graph_sdWalksExt(SCIP*, const GRAPH*, const SCIP_Real*, SCIP_Real, int, int, int, int, SCIP_Real*, int*, int*, int*, int*, int*, int*, STP_Bool*);
435 extern SCIP_Bool graph_sdWalksExt2(SCIP*, const GRAPH*, const SCIP_Real*, const int*, SCIP_Real, int, int, int, int, SCIP_Real*, int*, int*, int*, int*, int*, int*, int*, int*, int*, int*, STP_Bool*);
436 extern SCIP_RETCODE graph_sdComputeCliqueStar(SCIP*, const GRAPH*, const SDPROFIT*, SDCLIQUE*);
437 
438 
439 /* graph_vnoi.c
440  */
441 extern SCIP_RETCODE graph_vnoiInit(SCIP*, const GRAPH*, SCIP_Bool, VNOI**);
442 extern void graph_vnoiFree(SCIP*, VNOI**);
443 extern SCIP_RETCODE graph_vnoiCompute(SCIP*, const GRAPH*, VNOI*);
444 extern SCIP_RETCODE graph_vnoiComputeImplied(SCIP*, const GRAPH*, const SDPROFIT*, VNOI*);
445 extern void graph_voronoi(const GRAPH*, const SCIP_Real*, const SCIP_Real*, const STP_Bool*, int*, PATH*);
446 extern void graph_voronoiTerms(const GRAPH*, const SCIP_Bool*, int* RESTRICT, PATH* RESTRICT);
447 extern void graph_voronoiRepair(SCIP*, const GRAPH*, const SCIP_Real*, const SCIP_Real*, int*, int*, PATH*, int*, int, UF*);
448 extern void graph_voronoiRepairMult(SCIP*, const GRAPH*, const SCIP_Real*, const STP_Bool*, int* RESTRICT, int* RESTRICT, int* RESTRICT, int* RESTRICT, UF* RESTRICT, PATH* RESTRICT);
449 extern void graph_voronoiWithRadiusMw(SCIP*, const GRAPH*, PATH*, const SCIP_Real*, SCIP_Real*, int*, int*, int*);
450 extern void graph_voronoiMw(SCIP*, const GRAPH*, const SCIP_Real*, PATH*, int*, int*, int*);
451 extern void graph_add1stTermPaths(const GRAPH*, const SCIP_Real*, PATH*, int*, int*);
452 extern void voronoiSteinerTreeExt(SCIP*, const GRAPH*, SCIP_Real*, int*, STP_Bool*, PATH*);
453 extern SCIP_RETCODE graph_voronoiExtend(SCIP*, const GRAPH*, const SCIP_Real*, PATH*, SCIP_Real**, int**, int**, STP_Bool*, int*, int*, int*, int, int, int);
454 extern SCIP_RETCODE graph_voronoiWithDist(SCIP*, const GRAPH*, const SCIP_Bool*, const SCIP_Real*, double*, int*, int*, int*, int*, PATH*);
455 extern SCIP_RETCODE graph_voronoiWithRadius(SCIP*, const GRAPH*, GRAPH*, PATH*, SCIP_Real*, SCIP_Real*, SCIP_Real*, int*, int*, int*);
456 
457 
458 /* graph_mcut.c
459  */
460 #if 0
461 extern void graph_mincut_exit(SCIP*, GRAPH*);
462 extern void graph_mincut_exec(GRAPH*, int, int, int, const int*, int*, const int*, const int*, const int*, int);
463 extern SCIP_RETCODE graph_mincut_init(SCIP*, GRAPH*);
464 #else
465 extern void graph_mincut_exit(SCIP*, GRAPH*);
466 extern void graph_mincut_exec(const GRAPH*, const int, const int, const int, const int, const int, const int*, const int*, int* RESTRICT, const int*, const int*, const int*, const SCIP_Bool);
467 extern SCIP_RETCODE graph_mincut_init(SCIP*, GRAPH*);
468 extern SCIP_RETCODE graph_mincut_reInit(SCIP*, int, int, GRAPH*);
469 extern SCIP_Bool graph_mincut_isInitialized(const GRAPH*);
470 extern void graph_mincut_setDefaultVals(GRAPH*);
471 #endif
472 
473 /* graph_load.c
474  */
475 extern SCIP_RETCODE graph_load(SCIP*, GRAPH**, const char*, PRESOL*);
476 
477 /* graph_save.c
478  */
479 extern void graph_save(SCIP*, const GRAPH*, const char*, FILETYPE);
480 extern void graph_writeReductionStats(const GRAPH*, const char*, const char*);
481 extern void graph_writeReductionRatioStats(const GRAPH*, const char*, const char*);
482 extern SCIP_RETCODE graph_writeReductionRatioStatsLive(SCIP*, GRAPH*, const char*);
483 extern SCIP_RETCODE graph_writeGml(const GRAPH*, const char*, const SCIP_Bool*);
484 extern SCIP_RETCODE graph_writeGmlSub(const GRAPH*, const char*, const SCIP_Bool*);
485 extern void graph_writeStp(SCIP*, const GRAPH*, FILE*, SCIP_Real);
486 extern void graph_writeStpByName(SCIP*, const GRAPH*, const char*, SCIP_Real);
487 extern void graph_writeStpOrg(SCIP*, const GRAPH*, const char*);
488 
489 
490 /* validate.c
491  */
492 extern SCIP_RETCODE SCIPStpValidateSol(SCIP*, const GRAPH*, const double*, SCIP_Bool, SCIP_Bool*);
493 
494 
495 
496 #ifdef __cplusplus
497 }
498 #endif
499 
500 
501 #endif /* !APPLICATIONS_STP_GRAPH_H_ */
STP_Vectype
#define STP_Vectype(type)
Definition: stpvector.h:44
graph_csr_copy
void graph_csr_copy(const CSR *, CSR *)
Definition: graph_util.c:1483
presolve_info
Definition: graphdefs.h:274
graph_csrdepo_addEmptyTopTree
void graph_csrdepo_addEmptyTopTree(CSRDEPO *, int)
Definition: graph_util.c:836
Int_List_Node
Definition: misc_stp.h:88
graph_edge_delPseudoAncestors
void graph_edge_delPseudoAncestors(SCIP *, int, GRAPH *)
Definition: graph_history.c:1128
graph_init_csr
SCIP_RETCODE graph_init_csr(SCIP *, GRAPH *)
Definition: graph_util.c:1581
graph_singletonAncestors_init
SCIP_RETCODE graph_singletonAncestors_init(SCIP *, const GRAPH *, int, SINGLETONANS *)
Definition: graph_history.c:684
graph_path_st
void graph_path_st(const GRAPH *, const SCIP_Real *, SCIP_Real *, int *, int, STP_Bool *)
Definition: graph_path.c:1199
graph_transPcmw2rooted
SCIP_RETCODE graph_transPcmw2rooted(SCIP *, GRAPH *, SCIP_Real, SCIP_Bool)
Definition: graph_trans.c:809
graph_get_nEdges
int graph_get_nEdges(const GRAPH *)
Definition: graph_stats.c:548
graph_edge_nPseudoAncestors
int graph_edge_nPseudoAncestors(const GRAPH *, int)
Definition: graph_history.c:1159
compressed_sparse_storages_depository
Definition: graph_util.c:38
graph_pseudoAncestors_unhashEdge
void graph_pseudoAncestors_unhashEdge(const PSEUDOANS *, int, int *)
Definition: graph_history.c:854
graph_edge_delPseudoPath
SCIP_RETCODE graph_edge_delPseudoPath(SCIP *, GRAPH *, int, int, int, SCIP_Real *)
Definition: graph_delpseudo.c:1136
graph_knot_chg
void graph_knot_chg(GRAPH *, int, int)
Definition: graph_node.c:86
graph_valid_pseudoAncestors
SCIP_Bool graph_valid_pseudoAncestors(SCIP *, const GRAPH *)
Definition: graph_history.c:1569
graph_csrdepo_clean
void graph_csrdepo_clean(CSRDEPO *)
Definition: graph_util.c:781
graph_valid_ancestors
SCIP_Bool graph_valid_ancestors(SCIP *, const GRAPH *)
Definition: graph_history.c:753
graph_pc_realDegree
int graph_pc_realDegree(const GRAPH *, int, SCIP_Bool)
Definition: graph_pcbase.c:2112
graph_pc_contractNodeAncestors
SCIP_RETCODE graph_pc_contractNodeAncestors(SCIP *, GRAPH *, int, int, int)
Definition: graph_pcbase.c:2352
graph_csr_print
void graph_csr_print(const CSR *)
Definition: graph_util.c:1514
graph_pc_getBiased
void graph_pc_getBiased(const GRAPH *, SCIP_Real *RESTRICT, SCIP_Real *RESTRICT)
graph_pc_isMw
SCIP_Bool graph_pc_isMw(const GRAPH *)
Definition: graph_pcbase.c:2475
graph_knot_getContractionRecordAncestor
int graph_knot_getContractionRecordAncestor(int, const SUBINOUT *)
Definition: graph_sub.c:895
graph_tpathsAdd4th
void graph_tpathsAdd4th(const GRAPH *, const SCIP_Real *, const SCIP_Real *, const SDPROFIT *, TPATHS *)
Definition: graph_tpath.c:2112
graph_edge_del
void graph_edge_del(SCIP *, GRAPH *, int, SCIP_Bool)
Definition: graph_edge.c:368
graph_knot_contractFixed
SCIP_RETCODE graph_knot_contractFixed(SCIP *, GRAPH *, int *, int, int, int)
Definition: graph_node.c:521
graph_sdWalksConnected
SCIP_Bool graph_sdWalksConnected(SCIP *, const GRAPH *, const int *, const SCIP_Real *, const STP_Bool *, int, int, SCIP_Real *, int *, int *, STP_Bool *, SCIP_Bool)
Definition: graph_sdpath.c:2285
graph_typeIsDirected
SCIP_Bool graph_typeIsDirected(const GRAPH *)
Definition: graph_stats.c:83
FILETYPE
FILETYPE
Definition: graphdefs.h:115
graph_edge_printPseudoAncestors
void graph_edge_printPseudoAncestors(const GRAPH *, int)
Definition: graph_history.c:1248
graph_pseudoAncestors_nodeIsHashed
SCIP_Bool graph_pseudoAncestors_nodeIsHashed(const PSEUDOANS *, int, const int *)
Definition: graph_history.c:962
graph_fixed_addEdge
SCIP_RETCODE graph_fixed_addEdge(SCIP *, int, GRAPH *)
Definition: graph_history.c:1760
graph_sdWalksExt
SCIP_Bool graph_sdWalksExt(SCIP *, const GRAPH *, const SCIP_Real *, SCIP_Real, int, int, int, int, SCIP_Real *, int *, int *, int *, int *, int *, int *, STP_Bool *)
Definition: graph_sdpath.c:1999
graph_pc_isRootedPcMw
SCIP_Bool graph_pc_isRootedPcMw(const GRAPH *)
Definition: graph_pcbase.c:2681
graph_writeReductionRatioStats
void graph_writeReductionRatioStats(const GRAPH *, const char *, const char *)
Definition: graph_save.c:285
graph_voronoiWithDist
SCIP_RETCODE graph_voronoiWithDist(SCIP *, const GRAPH *, const SCIP_Bool *, const SCIP_Real *, double *, int *, int *, int *, int *, PATH *)
graph_csr_costsAreInSync
SCIP_Bool graph_csr_costsAreInSync(const GRAPH *, const CSR *, const SCIP_Real *)
Definition: graph_util.c:1448
graph_pc_subtractPrize
void graph_pc_subtractPrize(SCIP *, GRAPH *, SCIP_Real, int)
Definition: graph_pcbase.c:2315
graph_tpathsGetClosestTerm
void graph_tpathsGetClosestTerm(const GRAPH *, const TPATHS *, int, int *RESTRICT, int *RESTRICT, SCIP_Real *RESTRICT)
graph_sdWalks_csr
SCIP_Bool graph_sdWalks_csr(SCIP *, const GRAPH *, const int *, SCIP_Real, int, int, int, SCIP_Real *, int *, int *, DHEAP *, STP_Bool *)
Definition: graph_sdpath.c:1696
graph_subinoutActivateEdgeMap
SCIP_RETCODE graph_subinoutActivateEdgeMap(const GRAPH *, SUBINOUT *)
Definition: graph_sub.c:769
graph_edge_addBi
void graph_edge_addBi(SCIP *, GRAPH *, int, int, double)
graph_valid
SCIP_Bool graph_valid(SCIP *, const GRAPH *)
Definition: graph_base.c:1480
graph_add3rdTermPaths
void graph_add3rdTermPaths(const GRAPH *, const SCIP_Real *, const SCIP_Real *, PATH *, int *, int *)
Definition: graph_tpath.c:1501
graph_pc_presolInit
SCIP_RETCODE graph_pc_presolInit(SCIP *, GRAPH *)
Definition: graph_pcbase.c:815
graph_getIsTermArray
void graph_getIsTermArray(const GRAPH *, SCIP_Bool *)
Definition: graph_base.c:540
graph_pc_termMarkProper
void graph_pc_termMarkProper(const GRAPH *, int *)
Definition: graph_pcbase.c:1500
graph_subinoutUsesNewHistory
SCIP_Bool graph_subinoutUsesNewHistory(const SUBINOUT *)
Definition: graph_sub.c:848
graph_findCentralTerminal
SCIP_RETCODE graph_findCentralTerminal(SCIP *, const GRAPH *, int, int *)
Definition: graph_util.c:410
graph_mincut_isInitialized
SCIP_Bool graph_mincut_isInitialized(const GRAPH *)
Definition: graph_mcut.c:1139
graph_get3nextTermPaths
void graph_get3nextTermPaths(GRAPH *, const SCIP_Real *, const SCIP_Real *, PATH *, int *, int *)
Definition: graph_tpath.c:1562
graph_pc_nFixedTerms
int graph_pc_nFixedTerms(const GRAPH *)
Definition: graph_pcbase.c:2526
graph_path_exec
void graph_path_exec(SCIP *, const GRAPH *, int, int, const SCIP_Real *, PATH *)
Definition: graph_path.c:541
graph_csr_build
void graph_csr_build(const GRAPH *, const SCIP_Real *, CSR *)
Definition: graph_util.c:1351
graph_contractTrace
int graph_contractTrace(int, const GRAPH *)
Definition: graph_history.c:1872
graph_mark
void graph_mark(GRAPH *)
Definition: graph_base.c:1130
graph_free_dcsr
void graph_free_dcsr(SCIP *, GRAPH *)
Definition: graph_util.c:1807
graph_writeStp
void graph_writeStp(SCIP *, const GRAPH *, FILE *, SCIP_Real)
Definition: graph_save.c:568
graph_pseudoAncestorsGetHashArraySize
int graph_pseudoAncestorsGetHashArraySize(const PSEUDOANS *)
Definition: graph_history.c:1321
UnionFind_Structure
Definition: misc_stp.h:78
graph_subinoutGetContractionRecord
const int * graph_subinoutGetContractionRecord(const SUBINOUT *)
Definition: graph_sub.c:837
dijkstra_heap
Definition: graphdefs.h:301
graph_pseudoAncestors_appendCopyNodeToEdge
SCIP_RETCODE graph_pseudoAncestors_appendCopyNodeToEdge(SCIP *, int, int, SCIP_Bool, GRAPH *, SCIP_Bool *)
Definition: graph_history.c:1380
graph_pc_term2edgeIsConsistent
SCIP_Bool graph_pc_term2edgeIsConsistent(SCIP *, const GRAPH *)
Definition: graph_pcbase.c:874
graph_writeReductionStats
void graph_writeReductionStats(const GRAPH *, const char *, const char *)
Definition: graph_save.c:412
graph_knot_printInfo
void graph_knot_printInfo(const GRAPH *, int)
Definition: graph_stats.c:151
graph_fixed_addNodePc
SCIP_RETCODE graph_fixed_addNodePc(SCIP *, int, GRAPH *)
Definition: graph_history.c:1778
graph_free
void graph_free(SCIP *, GRAPH **, SCIP_Bool)
Definition: graph_base.c:796
graph_pc_2org
void graph_pc_2org(SCIP *, GRAPH *)
Definition: graph_pcbase.c:1976
graph_path_init
SCIP_RETCODE graph_path_init(SCIP *, GRAPH *)
Definition: graph_path.c:480
graph_dcsr_deleteEdgeBi
void graph_dcsr_deleteEdgeBi(SCIP *, DCSR *, int)
Definition: graph_util.c:1894
graph_initPseudoAncestorsSized
SCIP_RETCODE graph_initPseudoAncestorsSized(SCIP *, int, GRAPH *)
Definition: graph_history.c:1064
graph_pseudoAncestors_appendCopyNode
SCIP_RETCODE graph_pseudoAncestors_appendCopyNode(SCIP *, int, int, SCIP_Bool, GRAPH *, SCIP_Bool *)
Definition: graph_history.c:1358
graph_pc_nonLeafTermIsEnforced
SCIP_Bool graph_pc_nonLeafTermIsEnforced(SCIP *, const GRAPH *, int)
Definition: graph_pcbase.c:1589
graph_subinoutFree
void graph_subinoutFree(SCIP *, SUBINOUT **)
Definition: graph_sub.c:859
graph_pseudoAncestors_unhashNode
void graph_pseudoAncestors_unhashNode(const PSEUDOANS *, int, int *)
Definition: graph_history.c:870
graph_subinoutActivateNewHistory
void graph_subinoutActivateNewHistory(SUBINOUT *)
Definition: graph_sub.c:788
graph_pseudoAncestors_unhashNodeDirty
void graph_pseudoAncestors_unhashNodeDirty(const PSEUDOANS *, int, int *)
Definition: graph_history.c:934
graph_pathHeapAdd
void graph_pathHeapAdd(const PATH *, int, int *RESTRICT, int *RESTRICT, int *)
graph_pseudoAncestors_hashNodeDirty
void graph_pseudoAncestors_hashNodeDirty(const PSEUDOANS *, int, SCIP_Bool, SCIP_Bool *, int *)
Definition: graph_history.c:902
graph_pc_enforceNonLeafTerm
void graph_pc_enforceNonLeafTerm(SCIP *, GRAPH *, int)
Definition: graph_pcbase.c:1556
SCIP_RETCODE
enum SCIP_Retcode SCIP_RETCODE
Definition: type_retcode.h:54
voronoi_storage
Definition: graphdefs.h:326
graph_grid_coordinates
SCIP_RETCODE graph_grid_coordinates(SCIP *, int **, int **, int *, int, int)
Definition: graph_grid.c:486
graph_edge_redirect
int graph_edge_redirect(SCIP *, GRAPH *, int, int, int, SCIP_Real, SCIP_Bool, SCIP_Bool)
Definition: graph_edge.c:103
shortest_path
Definition: graphdefs.h:284
graph_heap_clean
void graph_heap_clean(SCIP_Bool, DHEAP *)
Definition: graph_util.c:938
graph_voronoiRepairMult
void graph_voronoiRepairMult(SCIP *, const GRAPH *, const SCIP_Real *, const STP_Bool *, int *RESTRICT, int *RESTRICT, int *RESTRICT, int *RESTRICT, UF *RESTRICT, PATH *RESTRICT)
graph_tpathsGet3CloseTerms
void graph_tpathsGet3CloseTerms(const GRAPH *, const TPATHS *, int, SCIP_Real, int *RESTRICT, int *RESTRICT, SCIP_Real *RESTRICT, int *RESTRICT)
graph_subinoutGetSubToOrgNodeMap
const int * graph_subinoutGetSubToOrgNodeMap(const SUBINOUT *)
Definition: graph_sub.c:799
graph_termsReachable
SCIP_RETCODE graph_termsReachable(SCIP *, const GRAPH *, SCIP_Bool *)
Definition: graph_util.c:370
graph_tpathsPrintForNode
void graph_tpathsPrintForNode(const GRAPH *, const SDPROFIT *, const TPATHS *, int)
Definition: graph_tpath.c:1793
graph_knot_replaceDeg2
SCIP_RETCODE graph_knot_replaceDeg2(SCIP *, int, SCIP_Real, int, GRAPH *, SCIP_Bool *)
Definition: graph_node.c:158
graph_transPcGetSap
SCIP_RETCODE graph_transPcGetSap(SCIP *, GRAPH *, GRAPH **, SCIP_Real *)
Definition: graph_trans.c:931
graph_knot_getPseudoAncestors
const int * graph_knot_getPseudoAncestors(const GRAPH *, int)
Definition: graph_history.c:1269
graph_csrdepo_getTopCSR
void graph_csrdepo_getTopCSR(const CSRDEPO *, CSR *)
Definition: graph_util.c:684
subgraph_extraction_insertion
Definition: graph_sub.c:54
graph_knot_contract
SCIP_RETCODE graph_knot_contract(SCIP *, GRAPH *, int *, int, int)
Definition: graph_node.c:264
graph_add4thTermPaths
void graph_add4thTermPaths(const GRAPH *, const SCIP_Real *, const SCIP_Real *, PATH *, int *, int *)
Definition: graph_tpath.c:1521
graph_heap_deleteMin
void graph_heap_deleteMin(int *, SCIP_Real *, DHEAP *)
Definition: graph_util.c:1053
graph_path_PcMwSd
void graph_path_PcMwSd(SCIP *, const GRAPH *, PATH *, SCIP_Real *, SCIP_Real, int *, int *, int *, int *, int *, int *, int, int, int)
Definition: graph_path.c:788
graph_csr_getNedges
int graph_csr_getNedges(const CSR *)
Definition: graph_util.c:1536
graph_tpathsAdd1st
void graph_tpathsAdd1st(const GRAPH *, const SCIP_Real *, const SDPROFIT *, TPATHS *)
Definition: graph_tpath.c:1932
graph_heap_isClean
SCIP_Bool graph_heap_isClean(const DHEAP *)
Definition: graph_util.c:962
graph_tpathsSetAll3
void graph_tpathsSetAll3(GRAPH *, const SCIP_Real *, const SCIP_Real *, const SDPROFIT *, TPATHS *)
Definition: graph_tpath.c:2219
graph_mincut_init
SCIP_RETCODE graph_mincut_init(SCIP *, GRAPH *)
Definition: graph_mcut.c:1105
graph_pc_getNonLeafTermOffset
SCIP_Real graph_pc_getNonLeafTermOffset(SCIP *, const GRAPH *)
Definition: graph_pcbase.c:2209
graph_pseudoAncestors_hashEdge
void graph_pseudoAncestors_hashEdge(const PSEUDOANS *, int, int *)
Definition: graph_history.c:824
graph_mincut_reInit
SCIP_RETCODE graph_mincut_reInit(SCIP *, int, int, GRAPH *)
Definition: graph_mcut.c:1120
graph_voronoiWithRadius
SCIP_RETCODE graph_voronoiWithRadius(SCIP *, const GRAPH *, GRAPH *, PATH *, SCIP_Real *, SCIP_Real *, SCIP_Real *, int *, int *, int *)
Definition: graph_vnoi.c:774
graph_pc_termToNonLeafTerm
void graph_pc_termToNonLeafTerm(SCIP *, GRAPH *, int, SCIP_Bool)
Definition: graph_pcbase.c:1210
graph_pack
SCIP_RETCODE graph_pack(SCIP *, GRAPH *, GRAPH **, REDSOL *, SCIP_Bool)
Definition: graph_base.c:1324
graph_printEdgeConflicts
SCIP_RETCODE graph_printEdgeConflicts(SCIP *, const GRAPH *)
Definition: graph_stats.c:408
graph_printInfo
void graph_printInfo(const GRAPH *)
Definition: graph_stats.c:299
graph_path_st_pcmw_reduce
void graph_path_st_pcmw_reduce(SCIP *, const GRAPH *, const SCIP_Real *, SCIP_Real *, int *, int, STP_Bool *)
Definition: graph_path.c:1556
graph_voronoiRepair
void graph_voronoiRepair(SCIP *, const GRAPH *, const SCIP_Real *, const SCIP_Real *, int *, int *, PATH *, int *, int, UF *)
Definition: graph_vnoi.c:1100
graph_resize
SCIP_RETCODE graph_resize(SCIP *, GRAPH *, int, int, int)
Definition: graph_base.c:744
graph_pc_fixedTermToNonTerm
void graph_pc_fixedTermToNonTerm(SCIP *, GRAPH *, int)
Definition: graph_pcbase.c:1189
graph_valid_csr
SCIP_Bool graph_valid_csr(const GRAPH *, SCIP_Bool verbose)
Definition: graph_util.c:1694
graph_vnoiFree
void graph_vnoiFree(SCIP *, VNOI **)
Definition: graph_vnoi.c:1348
stpvector.h
header only, simple implementation of an STL like vector
graph_sdWalks
SCIP_Bool graph_sdWalks(SCIP *, const GRAPH *, const SCIP_Real *, const int *, SCIP_Real, int, int, int, SCIP_Real *, int *, int *, int *, int *, STP_Bool *)
Definition: graph_sdpath.c:1564
graph_obstgrid_create
SCIP_RETCODE graph_obstgrid_create(SCIP *, GRAPH **, int **, int **, int, int, int, int)
Definition: graph_grid.c:175
graph_tpathsRecomputeBiased
SCIP_RETCODE graph_tpathsRecomputeBiased(const SDPROFIT *, GRAPH *, TPATHS *)
Definition: graph_tpath.c:1776
graph_pc_knotHasMaxPrize
SCIP_Bool graph_pc_knotHasMaxPrize(const GRAPH *, int)
Definition: graph_pcbase.c:1315
graph_validInput
SCIP_Bool graph_validInput(SCIP *, const GRAPH *)
Definition: graph_base.c:1619
graph_init_dcsr
SCIP_RETCODE graph_init_dcsr(SCIP *, GRAPH *)
Definition: graph_util.c:1721
graph_get2nextTermPaths
void graph_get2nextTermPaths(GRAPH *, const SCIP_Real *, const SCIP_Real *, PATH *, int *, int *)
Definition: graph_tpath.c:1542
graph_csr_chgCosts
void graph_csr_chgCosts(const GRAPH *, const SCIP_Real *, CSR *)
Definition: graph_util.c:1298
graph_pseudoAncestors_appendMoveNode
SCIP_RETCODE graph_pseudoAncestors_appendMoveNode(SCIP *, int, int, SCIP_Bool, GRAPH *, SCIP_Bool *)
Definition: graph_history.c:1506
graph_edge_reinsert
SCIP_RETCODE graph_edge_reinsert(SCIP *, GRAPH *, int, int, int, SCIP_Real, int, SINGLETONANS *, SINGLETONANS *, int *, SCIP_Bool *)
Definition: graph_edge.c:200
graph_pseudoAncestors_unhashEdgeDirty
void graph_pseudoAncestors_unhashEdgeDirty(const PSEUDOANS *, int, int *)
Definition: graph_history.c:918
graph_initAncestors
SCIP_RETCODE graph_initAncestors(SCIP *, GRAPH *)
Definition: graph_history.c:975
graph_tpathsSetAll4
void graph_tpathsSetAll4(GRAPH *, const SCIP_Real *, const SCIP_Real *, const SDPROFIT *, TPATHS *)
Definition: graph_tpath.c:2260
graph_pc_termIsNonLeafTerm
SCIP_Bool graph_pc_termIsNonLeafTerm(const GRAPH *, int)
Definition: graph_pcbase.c:1431
graph_pc_initPrizes
SCIP_RETCODE graph_pc_initPrizes(SCIP *, GRAPH *, int)
Definition: graph_pcbase.c:741
graph_vnoiCompute
SCIP_RETCODE graph_vnoiCompute(SCIP *, const GRAPH *, VNOI *)
Definition: graph_vnoi.c:1302
graph_sdWalksTriangle
SCIP_Bool graph_sdWalksTriangle(SCIP *, const GRAPH *, const int *, const int *, SCIP_Real, int, int, int, SCIP_Real *, SCIP_Real *, int *, int *, DHEAP *, STP_Bool *)
Definition: graph_sdpath.c:1830
graph_csrdepo_isEmpty
SCIP_Bool graph_csrdepo_isEmpty(const CSRDEPO *)
Definition: graph_util.c:851
graph_path_invroot
void graph_path_invroot(SCIP *, const GRAPH *, int, const SCIP_Real *, SCIP_Real *, int *)
Definition: graph_path.c:973
graph_knotIsNWLeaf
SCIP_Bool graph_knotIsNWLeaf(const GRAPH *, int)
Definition: graph_node.c:35
graph_pc_initSubgraph
SCIP_RETCODE graph_pc_initSubgraph(SCIP *, GRAPH *)
Definition: graph_pcbase.c:763
graph_knot_delFull
void graph_knot_delFull(SCIP *, GRAPH *, int, SCIP_Bool)
Definition: graph_node.c:131
graph_dijkLimited_reset
void graph_dijkLimited_reset(const GRAPH *, DIJK *)
Definition: graph_util.c:2105
graph_pc_initTerm2Edge
SCIP_RETCODE graph_pc_initTerm2Edge(SCIP *, GRAPH *, int)
Definition: graph_pcbase.c:721
graph_tpathsInitBiased
SCIP_RETCODE graph_tpathsInitBiased(SCIP *, const SDPROFIT *, GRAPH *, TPATHS **)
Definition: graph_tpath.c:1700
graph_path_st_pcmw
void graph_path_st_pcmw(GRAPH *, SCIP_Real *, int *, const SCIP_Real *, const SCIP_Real *, SCIP_Bool, SCIP_Real *, int *, int, STP_Bool *)
Definition: graph_path.c:1430
graph_get4nextTTerms
SCIP_RETCODE graph_get4nextTTerms(SCIP *, GRAPH *, const SCIP_Real *, PATH *, int *, int *, int *)
Definition: graph_tpath.c:1601
graph_pc_getRoot2PtermEdge
int graph_pc_getRoot2PtermEdge(const GRAPH *, int)
Definition: graph_pcbase.c:2499
graph_pc_edgeIsExtended
SCIP_Bool graph_pc_edgeIsExtended(const GRAPH *, int)
Definition: graph_pcbase.c:1232
graph_buildOrgNodesToReducedMap
void graph_buildOrgNodesToReducedMap(const GRAPH *, int *)
Definition: graph_util.c:560
graph_path_st_dc
SCIP_RETCODE graph_path_st_dc(SCIP *, const GRAPH *, const SCIP_Real *, SCIP_Real *, int *, int, STP_Bool *, int *, STP_Bool *)
Definition: graph_path.c:1299
graph_csrdepo_hasEmptyTop
SCIP_Bool graph_csrdepo_hasEmptyTop(const CSRDEPO *)
Definition: graph_util.c:863
graph_edge_delPseudo
SCIP_RETCODE graph_edge_delPseudo(SCIP *, GRAPH *, const SCIP_Real *, const SCIP_Real *, const SCIP_Real *, int, SCIP_Real *, SCIP_Bool *)
Definition: graph_delpseudo.c:1097
graph_path_execX
void graph_path_execX(SCIP *, const GRAPH *, int, const SCIP_Real *, SCIP_Real *, int *)
Definition: graph_path.c:905
graph_transMw
SCIP_RETCODE graph_transMw(SCIP *, GRAPH *)
Definition: graph_trans.c:632
special_distance_implied_profit
Definition: reducedefs.h:135
misc_stp.h
miscellaneous methods used for solving Steiner problems
graph_pc_2trans
void graph_pc_2trans(SCIP *, GRAPH *)
Definition: graph_pcbase.c:2018
graph_get_nTerms
int graph_get_nTerms(const GRAPH *)
Definition: graph_stats.c:560
graph_subgraphCompleteNewHistory
SCIP_RETCODE graph_subgraphCompleteNewHistory(SCIP *, const int *, GRAPH *, GRAPH *)
Definition: graph_sub.c:920
graph_freePseudoAncestors
void graph_freePseudoAncestors(SCIP *, GRAPH *)
Definition: graph_history.c:1101
graph_transRpc2SpgTrivial
SCIP_RETCODE graph_transRpc2SpgTrivial(SCIP *, GRAPH *)
Definition: graph_trans.c:505
graph_writeStpByName
void graph_writeStpByName(SCIP *, const GRAPH *, const char *, SCIP_Real)
Definition: graph_save.c:550
graph_tpathsGetProfitNodes
void graph_tpathsGetProfitNodes(SCIP *, const GRAPH *, const TPATHS *, const SDPROFIT *, int, int, STP_Vectype(int))
Definition: graph_tpath.c:1842
graph_getNfixpseudonodes
int graph_getNfixpseudonodes(const GRAPH *)
Definition: graph_history.c:1971
graph_dcsr_deleteEdge
void graph_dcsr_deleteEdge(DCSR *, int, int)
Definition: graph_util.c:1840
graph_get_nVET
void graph_get_nVET(const GRAPH *, int *, int *, int *)
Definition: graph_stats.c:571
graph_pseudoAncestors_appendCopySingToEdge
SCIP_RETCODE graph_pseudoAncestors_appendCopySingToEdge(SCIP *, int, const SINGLETONANS *, SCIP_Bool, GRAPH *, SCIP_Bool *)
Definition: graph_history.c:1426
graph_csr_allocWithEdgeId
SCIP_RETCODE graph_csr_allocWithEdgeId(SCIP *, int, int, CSR **)
Definition: graph_util.c:1270
graph_transRpcToSpgIsStable
SCIP_Bool graph_transRpcToSpgIsStable(const GRAPH *, SCIP_Real)
Definition: graph_trans.c:1188
graph_mincut_setDefaultVals
void graph_mincut_setDefaultVals(GRAPH *)
Definition: graph_mcut.c:1081
graph_free_fixed
void graph_free_fixed(SCIP *, GRAPH *)
Definition: graph_history.c:1642
graph_pc_shiftNonLeafCosts
void graph_pc_shiftNonLeafCosts(SCIP *, GRAPH *)
Definition: graph_pcbase.c:671
graph_edge_addSubgraph
void graph_edge_addSubgraph(SCIP *, const GRAPH *, const int *, int, GRAPH *)
Definition: graph_edge.c:341
graph_transPc
SCIP_RETCODE graph_transPc(SCIP *, GRAPH *)
Definition: graph_trans.c:154
graph_pc_2transcheck
void graph_pc_2transcheck(SCIP *, GRAPH *)
Definition: graph_pcbase.c:2076
graph_transNw
SCIP_RETCODE graph_transNw(SCIP *, PRESOL *, GRAPH *)
Definition: graph_trans.c:1519
graph_getTermsRandom
SCIP_RETCODE graph_getTermsRandom(SCIP *, const GRAPH *, int *)
Definition: graph_base.c:588
dijkstra_heap_entry
Definition: graphdefs.h:294
graph_pseudoAncestors_appendCopyArrayToEdge
SCIP_RETCODE graph_pseudoAncestors_appendCopyArrayToEdge(SCIP *, int, const int *, int, GRAPH *, SCIP_Bool *)
Definition: graph_history.c:1458
reduction_solution_storage
Definition: reduce_sol.c:70
graph_initHistory
SCIP_RETCODE graph_initHistory(SCIP *, GRAPH *)
Definition: graph_base.c:695
graph_freeHistoryDeep
void graph_freeHistoryDeep(SCIP *, GRAPH *)
Definition: graph_base.c:900
graph_free_fixedEdgesOnly
void graph_free_fixedEdgesOnly(SCIP *, GRAPH *)
Definition: graph_history.c:1671
graph_edge_add
void graph_edge_add(SCIP *, GRAPH *, int, int, double, double)
graph_csrdepo_free
void graph_csrdepo_free(SCIP *, CSRDEPO **)
Definition: graph_util.c:637
graph_getCsr
void graph_getCsr(const GRAPH *, int *RESTRICT, int *RESTRICT, int *RESTRICT, int *)
graph_csrdepo_getEmptyTop
void graph_csrdepo_getEmptyTop(const CSRDEPO *, CSR *)
Definition: graph_util.c:874
graph_pc_knotToFixedTermProperty
void graph_pc_knotToFixedTermProperty(GRAPH *, int)
Definition: graph_pcbase.c:1062
graph_knot_contractLowdeg2High
SCIP_RETCODE graph_knot_contractLowdeg2High(SCIP *, GRAPH *, int *, int, int)
Definition: graph_node.c:539
graph_tpathsRepair
SCIP_RETCODE graph_tpathsRepair(SCIP *, int, SCIP_Bool, const GRAPH *, TPATHS *)
Definition: graph_tpath.c:1744
graph_knot_add
void graph_knot_add(GRAPH *, int)
Definition: graph_node.c:64
graph_pc_termToNonTerm
void graph_pc_termToNonTerm(SCIP *, GRAPH *, int)
Definition: graph_pcbase.c:1158
graph_subgraphExtract
SCIP_RETCODE graph_subgraphExtract(SCIP *, GRAPH *, SUBINOUT *, GRAPH **)
Definition: graph_sub.c:712
graph_path_st_pcmw_extend
void graph_path_st_pcmw_extend(SCIP *, const GRAPH *, const SCIP_Real *, SCIP_Bool, PATH *, STP_Bool *, SCIP_Bool *)
Definition: graph_path.c:1706
graph_isAlmostUniform
SCIP_Bool graph_isAlmostUniform(const GRAPH *)
Definition: graph_stats.c:237
graph_pseudoAncestors_addToEdge
SCIP_RETCODE graph_pseudoAncestors_addToEdge(SCIP *, int, int, GRAPH *)
Definition: graph_history.c:1523
graph_edge_delBlocked
void graph_edge_delBlocked(SCIP *, GRAPH *, const SCIP_Bool *, SCIP_Bool)
Definition: graph_edge.c:448
graph_pc_knotToNonTermProperty
void graph_pc_knotToNonTermProperty(GRAPH *, int)
Definition: graph_pcbase.c:1044
graph_knot_hasContractTrace
SCIP_Bool graph_knot_hasContractTrace(int, const GRAPH *)
Definition: graph_history.c:1859
graph_initPseudoAncestors
SCIP_RETCODE graph_initPseudoAncestors(SCIP *, GRAPH *)
Definition: graph_history.c:1049
graph_knot_delPseudo
SCIP_RETCODE graph_knot_delPseudo(SCIP *, GRAPH *, const SCIP_Real *, const SCIP_Real *, const SCIP_Real *, int, REDCOST *, SCIP_Bool *)
Definition: graph_delpseudo.c:1015
graph_transPc2Spg
SCIP_RETCODE graph_transPc2Spg(SCIP *, PRESOL *, GRAPH *)
Definition: graph_trans.c:257
graph_copyFixed
SCIP_RETCODE graph_copyFixed(SCIP *, GRAPH *, SCIP_Bool, GRAPH *)
Definition: graph_history.c:1895
graph_knot_del
void graph_knot_del(SCIP *, GRAPH *, int, SCIP_Bool)
Definition: graph_node.c:111
graph_pseudoAncestors_edgesInConflict
SCIP_Bool graph_pseudoAncestors_edgesInConflict(SCIP *, const GRAPH *, const int *, int)
Definition: graph_history.c:1010
graph_fixed_add
SCIP_RETCODE graph_fixed_add(SCIP *, IDX *, const int *, int, GRAPH *)
Definition: graph_history.c:1698
graph_free_pseudoAncestorsBlock
SCIP_RETCODE graph_free_pseudoAncestorsBlock(SCIP *, int, GRAPH *)
graph_pc_contractEdge
SCIP_RETCODE graph_pc_contractEdge(SCIP *, GRAPH *, int *, int, int, int)
Definition: graph_pcbase.c:2385
graph_fixed_resetMoved
void graph_fixed_resetMoved(GRAPH *)
Definition: graph_history.c:1821
graph_sdComputeCliqueStar
SCIP_RETCODE graph_sdComputeCliqueStar(SCIP *, const GRAPH *, const SDPROFIT *, SDCLIQUE *)
Definition: graph_sdpath.c:2398
graph_initContractTracing
SCIP_RETCODE graph_initContractTracing(SCIP *, GRAPH *)
Definition: graph_history.c:1836
graph_writeReductionRatioStatsLive
SCIP_RETCODE graph_writeReductionRatioStatsLive(SCIP *, GRAPH *, const char *)
Definition: graph_save.c:316
graph_csr_alloc
SCIP_RETCODE graph_csr_alloc(SCIP *, int, int, CSR **)
Definition: graph_util.c:1231
graph_knot_delPseudoCheckIfPossible
SCIP_RETCODE graph_knot_delPseudoCheckIfPossible(SCIP *, const GRAPH *, const SCIP_Real *, const SCIP_Real *, const SCIP_Real *, int, SCIP_Bool *)
Definition: graph_delpseudo.c:1063
graph_csrdepo_addEmptyTop
void graph_csrdepo_addEmptyTop(CSRDEPO *, int, int)
Definition: graph_util.c:800
graph_pseudoAncestors_appendCopyEdgeToNode
SCIP_RETCODE graph_pseudoAncestors_appendCopyEdgeToNode(SCIP *, int, int, SCIP_Bool, GRAPH *, SCIP_Bool *)
Definition: graph_history.c:1403
graph_pc_solGetObj
SCIP_Real graph_pc_solGetObj(SCIP *, const GRAPH *, const int *, SCIP_Real)
Definition: graph_pcbase.c:2603
graph_edge_delFull
void graph_edge_delFull(SCIP *, GRAPH *, int, SCIP_Bool)
Definition: graph_edge.c:418
graph_subgraphFree
void graph_subgraphFree(SCIP *, GRAPH **)
Definition: graph_sub.c:1022
graph_tpathsRepairSetUp
SCIP_RETCODE graph_tpathsRepairSetUp(const GRAPH *, TPATHS *)
Definition: graph_tpath.c:1719
graph_pc_knotIsPropPotTerm
SCIP_Bool graph_pc_knotIsPropPotTerm(const GRAPH *, int)
Definition: graph_pcbase.c:1288
voronoiSteinerTreeExt
void voronoiSteinerTreeExt(SCIP *, const GRAPH *, SCIP_Real *, int *, STP_Bool *, PATH *)
SCIPStpValidateSol
SCIP_RETCODE SCIPStpValidateSol(SCIP *, const GRAPH *, const double *, SCIP_Bool, SCIP_Bool *)
Definition: validate.c:202
STP_Bool
unsigned char STP_Bool
Definition: portab.h:34
graph_pc_enforcePseudoTerm
void graph_pc_enforcePseudoTerm(SCIP *, GRAPH *, int)
Definition: graph_pcbase.c:1530
graph_dijkLimited_init
SCIP_RETCODE graph_dijkLimited_init(SCIP *, const GRAPH *, DIJK **)
Definition: graph_util.c:1989
graph_copyData
SCIP_RETCODE graph_copyData(SCIP *, const GRAPH *, GRAPH *)
Definition: graph_base.c:957
graph_transNw2sap
SCIP_RETCODE graph_transNw2sap(SCIP *, PRESOL *, GRAPH *)
Definition: graph_trans.c:1487
graph_valid_dcsr
SCIP_Bool graph_valid_dcsr(const GRAPH *, SCIP_Bool verbose)
Definition: graph_util.c:1919
graph_sdStarBiased
SCIP_RETCODE graph_sdStarBiased(SCIP *, const GRAPH *, const SDPROFIT *, int, int *, DIJK *, SCIP_Bool *)
Definition: graph_sdpath.c:1289
graph_path_st_rpcmw
void graph_path_st_rpcmw(GRAPH *, SCIP_Real *, int *, const SCIP_Real *, const SCIP_Real *, SCIP_Real *, int *, int, STP_Bool *)
Definition: graph_path.c:1988
graph_heap_free
void graph_heap_free(SCIP *, SCIP_Bool, SCIP_Bool, DHEAP **)
Definition: graph_util.c:1034
graph_pc_getReductionRatios
void graph_pc_getReductionRatios(const GRAPH *, SCIP_Real *, SCIP_Real *)
Definition: graph_pcbase.c:1751
graph_pc_finalizeSubgraph
SCIP_RETCODE graph_pc_finalizeSubgraph(SCIP *, GRAPH *)
Definition: graph_pcbase.c:795
graph_dijkLimited_free
void graph_dijkLimited_free(SCIP *, DIJK **)
Definition: graph_util.c:2143
graph_csr_isValid
SCIP_Bool graph_csr_isValid(const CSR *, SCIP_Bool verbose)
Definition: graph_util.c:1637
graph_pc_knotChgPrize
void graph_pc_knotChgPrize(GRAPH *, SCIP_Real, int)
Definition: graph_pcbase.c:1399
SCIP_Bool
#define SCIP_Bool
Definition: def.h:84
graph_knot_nPseudoAncestors
int graph_knot_nPseudoAncestors(const GRAPH *, int)
Definition: graph_history.c:1174
graph_csrdepo_removeTop
void graph_csrdepo_removeTop(CSRDEPO *)
Definition: graph_util.c:753
graph_hasMultiEdges
SCIP_Bool graph_hasMultiEdges(SCIP *, const GRAPH *, SCIP_Bool)
Definition: graph_stats.c:185
graph_edge_isDeleted
SCIP_Bool graph_edge_isDeleted(const GRAPH *, int)
Definition: graph_stats.c:121
graph_mincut_exit
void graph_mincut_exit(SCIP *, GRAPH *)
Definition: graph_mcut.c:1175
graph_path_st_brmwcs
SCIP_RETCODE graph_path_st_brmwcs(SCIP *, GRAPH *, const SCIP_Real *, SCIP_Real *, int *, int, STP_Bool *, SCIP_Bool *)
Definition: graph_path.c:2146
graphdefs.h
includes graph definitions used for Steiner tree problems
graph_knot_delPseudoAncestors
void graph_knot_delPseudoAncestors(SCIP *, int, GRAPH *)
Definition: graph_history.c:1144
graph_isMarked
SCIP_Bool graph_isMarked(const GRAPH *)
Definition: graph_base.c:1165
graph_csrdepo_init
SCIP_RETCODE graph_csrdepo_init(SCIP *, int, int, CSRDEPO **)
Definition: graph_util.c:590
graph_fixed_moveNodePc
SCIP_RETCODE graph_fixed_moveNodePc(SCIP *, int, GRAPH *)
Definition: graph_history.c:1798
graph_pseudoAncestors_appendCopyEdge
SCIP_RETCODE graph_pseudoAncestors_appendCopyEdge(SCIP *, int, int, SCIP_Bool, GRAPH *, SCIP_Bool *)
Definition: graph_history.c:1334
graph_csrdepo_print
void graph_csrdepo_print(const CSRDEPO *)
Definition: graph_util.c:908
graph_pc_transOrgAreConistent
SCIP_Bool graph_pc_transOrgAreConistent(SCIP *, const GRAPH *, SCIP_Bool)
Definition: graph_pcbase.c:980
graph_subinoutGetOrgToSubNodeMap
const int * graph_subinoutGetOrgToSubNodeMap(const SUBINOUT *)
Definition: graph_sub.c:825
graph_voronoiTerms
void graph_voronoiTerms(const GRAPH *, const SCIP_Bool *, int *RESTRICT, PATH *RESTRICT)
graph_singletonAncestors_freeMembers
void graph_singletonAncestors_freeMembers(SCIP *, SINGLETONANS *)
Definition: graph_history.c:734
graph_tpathsAdd3rd
void graph_tpathsAdd3rd(const GRAPH *, const SCIP_Real *, const SCIP_Real *, const SDPROFIT *, TPATHS *)
Definition: graph_tpath.c:2044
graph_pc_nProperPotentialTerms
int graph_pc_nProperPotentialTerms(const GRAPH *)
Definition: graph_pcbase.c:2582
graph_edge_getPseudoAncestors
const int * graph_edge_getPseudoAncestors(const GRAPH *, int)
Definition: graph_history.c:1187
graph_getEdgeCosts
void graph_getEdgeCosts(const GRAPH *, SCIP_Real *RESTRICT, SCIP_Real *RESTRICT)
graph_voronoiMw
void graph_voronoiMw(SCIP *, const GRAPH *, const SCIP_Real *, PATH *, int *, int *, int *)
Definition: graph_vnoi.c:517
graph_knot_contract_dir
void graph_knot_contract_dir(GRAPH *, int, int)
graph_getFixedges
IDX * graph_getFixedges(const GRAPH *)
Definition: graph_history.c:1944
graph_update_dcsr
void graph_update_dcsr(SCIP *, GRAPH *)
Definition: graph_util.c:1829
graph_path_st_pcmw_extendBiased
void graph_path_st_pcmw_extendBiased(SCIP *, GRAPH *, const SCIP_Real *, const SCIP_Real *, PATH *, STP_Bool *, SCIP_Bool *)
Definition: graph_path.c:1845
graph_mincut_exec
void graph_mincut_exec(const GRAPH *, const int, const int, const int, const int, const int, const int *, const int *, int *RESTRICT, const int *, const int *, const int *, const SCIP_Bool)
graph_pc_updateSubgraphEdge
void graph_pc_updateSubgraphEdge(const GRAPH *, const int *, int, GRAPH *)
Definition: graph_pcbase.c:1661
graph_pc_getNorgEdges
int graph_pc_getNorgEdges(const GRAPH *)
Definition: graph_pcbase.c:1722
graph_grid_create
SCIP_RETCODE graph_grid_create(SCIP *, GRAPH **, int **, int, int, int)
Definition: graph_grid.c:338
graph_vnoiInit
SCIP_RETCODE graph_vnoiInit(SCIP *, const GRAPH *, SCIP_Bool, VNOI **)
Definition: graph_vnoi.c:1265
graph_pc_markOrgGraph
void graph_pc_markOrgGraph(GRAPH *)
Definition: graph_pcbase.c:1944
graph_edge_printInfo
void graph_edge_printInfo(const GRAPH *, int)
Definition: graph_stats.c:133
graph_copyPseudoAncestors
SCIP_RETCODE graph_copyPseudoAncestors(SCIP *, const GRAPH *, GRAPH *)
Definition: graph_base.c:1088
graph_pc_knotIsNonLeafTerm
SCIP_Bool graph_pc_knotIsNonLeafTerm(const GRAPH *, int)
Definition: graph_pcbase.c:1383
csr_storage
Definition: graphdefs.h:138
graph_transRpc
SCIP_RETCODE graph_transRpc(SCIP *, GRAPH *)
Definition: graph_trans.c:373
graph_tpathsGet4CloseTerms
void graph_tpathsGet4CloseTerms(const GRAPH *, const TPATHS *, int, SCIP_Real, int *RESTRICT, int *RESTRICT, SCIP_Real *RESTRICT, int *RESTRICT)
graph_path_st_pcmw_extendOut
void graph_path_st_pcmw_extendOut(SCIP *, const GRAPH *, int, STP_Bool *, SCIP_Real *, int *, STP_Bool *, DHEAP *, SCIP_Bool *)
Definition: graph_path.c:1051
graph_sdWalksExt2
SCIP_Bool graph_sdWalksExt2(SCIP *, const GRAPH *, const SCIP_Real *, const int *, SCIP_Real, int, int, int, int, SCIP_Real *, int *, int *, int *, int *, int *, int *, int *, int *, int *, int *, STP_Bool *)
Definition: graph_sdpath.c:2140
graph_edge_delHistory
void graph_edge_delHistory(SCIP *, GRAPH *, int)
Definition: graph_edge.c:466
graph_init_csrWithEdgeId
SCIP_RETCODE graph_init_csrWithEdgeId(SCIP *, GRAPH *)
Definition: graph_util.c:1603
graph_dijkLimited_initPcShifts
SCIP_RETCODE graph_dijkLimited_initPcShifts(SCIP *, const GRAPH *, DIJK *)
Definition: graph_util.c:2031
graph_heap_deleteMinGetNode
void graph_heap_deleteMinGetNode(int *, DHEAP *)
Definition: graph_util.c:1065
graph_uncover
void graph_uncover(GRAPH *)
Definition: graph_base.c:1276
graph_trail_costAware
SCIP_RETCODE graph_trail_costAware(SCIP *, const GRAPH *, int, SCIP_Bool *)
Definition: graph_util.c:353
graph_path_exit
void graph_path_exit(SCIP *, GRAPH *)
Definition: graph_path.c:515
singleton_ancestors_edge
Definition: graphdefs.h:173
graph_pc_isPc
SCIP_Bool graph_pc_isPc(const GRAPH *)
Definition: graph_pcbase.c:2463
graph_pc_adaptSap
void graph_pc_adaptSap(SCIP_Real, GRAPH *, SCIP_Real *)
Definition: graph_pcbase.c:2156
graph_writeStpOrg
void graph_writeStpOrg(SCIP *, const GRAPH *, const char *)
Definition: graph_save.c:799
graph_pseudoAncestors_hashNode
void graph_pseudoAncestors_hashNode(const PSEUDOANS *, int, int *)
Definition: graph_history.c:840
portab.h
Portable definitions.
graph_pc_nNonLeafTerms
int graph_pc_nNonLeafTerms(const GRAPH *)
Definition: graph_pcbase.c:2564
graph_transRpc2FixedProper
SCIP_RETCODE graph_transRpc2FixedProper(SCIP *, PRESOL *, GRAPH *)
Definition: graph_trans.c:531
graph_typeIsUndirected
SCIP_Bool graph_typeIsUndirected(const GRAPH *)
Definition: graph_stats.c:69
graph_sdCloseNodesBiased
SCIP_RETCODE graph_sdCloseNodesBiased(SCIP *, const GRAPH *, const SDPROFIT *, int, DIJK *)
Definition: graph_sdpath.c:1461
graph_edge_hide
void graph_edge_hide(GRAPH *, int)
Definition: graph_edge.c:483
graph_get4nextTermPaths
void graph_get4nextTermPaths(GRAPH *, const SCIP_Real *, const SCIP_Real *, PATH *, int *, int *)
Definition: graph_tpath.c:1582
graph_pc_enforceNode
void graph_pc_enforceNode(SCIP *, GRAPH *, int, SCIP_Real *)
Definition: graph_pcbase.c:1606
graph_tpathsAdd2nd
void graph_tpathsAdd2nd(const GRAPH *, const SCIP_Real *, const SCIP_Real *, const SDPROFIT *, TPATHS *)
Definition: graph_tpath.c:1987
dynamic_csr_storage
Definition: graphdefs.h:158
graph_trail_arr
SCIP_RETCODE graph_trail_arr(SCIP *, const GRAPH *, int, SCIP_Bool *)
Definition: graph_util.c:336
graph_freeHistory
void graph_freeHistory(SCIP *, GRAPH *)
Definition: graph_base.c:868
redcosts.h
Reduced cost based routines for Steiner problems.
graph_csrdepo_emptyTopSetMarked
void graph_csrdepo_emptyTopSetMarked(CSRDEPO *)
Definition: graph_util.c:890
graph_transPcGetRsap
SCIP_RETCODE graph_transPcGetRsap(SCIP *, GRAPH *, GRAPH **, const int *, int, int)
Definition: graph_trans.c:1043
graph_pc_2orgcheck
void graph_pc_2orgcheck(SCIP *, GRAPH *)
Definition: graph_pcbase.c:2062
graph_pc_knotIsDummyTerm
SCIP_Bool graph_pc_knotIsDummyTerm(const GRAPH *, int)
Definition: graph_pcbase.c:1344
graph_knot_printPseudoAncestors
void graph_knot_printPseudoAncestors(const GRAPH *, int)
Definition: graph_history.c:1226
graph_pathInLimitedExec
void graph_pathInLimitedExec(const GRAPH *, const SCIP_Real *, const SCIP_Bool *, int, DIJK *, SCIP_Real *)
Definition: graph_path.c:610
graph_pc_knotIsFixedTerm
SCIP_Bool graph_pc_knotIsFixedTerm(const GRAPH *, int)
Definition: graph_pcbase.c:1257
graph_subinoutInit
SCIP_RETCODE graph_subinoutInit(SCIP *, const GRAPH *, SUBINOUT **)
Definition: graph_sub.c:733
graph_edge_isInRange
SCIP_Bool graph_edge_isInRange(const GRAPH *, int)
Definition: graph_stats.c:110
graph_path_st_pcmw_full
void graph_path_st_pcmw_full(GRAPH *, const SCIP_Real *, SCIP_Real *, int *, int, STP_Bool *)
Definition: graph_path.c:1608
graph_subinoutClean
void graph_subinoutClean(SCIP *, SUBINOUT *)
Definition: graph_sub.c:882
graph_pc_contractEdgeUnordered
SCIP_RETCODE graph_pc_contractEdgeUnordered(SCIP *, GRAPH *, int *, int, int)
Definition: graph_pcbase.c:2439
graph_init_fixed
SCIP_RETCODE graph_init_fixed(SCIP *, GRAPH *)
Definition: graph_history.c:1618
graph_transNw2pc
SCIP_RETCODE graph_transNw2pc(SCIP *, PRESOL *, GRAPH *)
Definition: graph_trans.c:1420
graph_pc_isUnrootedPcMw
SCIP_Bool graph_pc_isUnrootedPcMw(const GRAPH *)
Definition: graph_pcbase.c:2669
graph_pc_deleteTerm
int graph_pc_deleteTerm(SCIP *, GRAPH *, int, SCIP_Real *)
Definition: graph_pcbase.c:2235
graph_csr_free
void graph_csr_free(SCIP *, CSR **)
Definition: graph_util.c:1554
graph_heap_create
SCIP_RETCODE graph_heap_create(SCIP *, int, int *, DENTRY *, DHEAP **)
Definition: graph_util.c:992
graph_subinoutGetSubToOrgEdgeMap
const int * graph_subinoutGetSubToOrgEdgeMap(const SUBINOUT *)
Definition: graph_sub.c:812
graph_pc_isPcMw
SCIP_Bool graph_pc_isPcMw(const GRAPH *)
Definition: graph_pcbase.c:2487
graph_add2ndTermPaths
void graph_add2ndTermPaths(const GRAPH *, const SCIP_Real *, const SCIP_Real *, PATH *, int *, int *)
Definition: graph_tpath.c:1482
graph_dijkLimited_clean
void graph_dijkLimited_clean(const GRAPH *, DIJK *)
Definition: graph_util.c:2083
graph_tpathsInit
SCIP_RETCODE graph_tpathsInit(SCIP *, GRAPH *, TPATHS **)
Definition: graph_tpath.c:1682
SCIP_Real
#define SCIP_Real
Definition: def.h:177
graph_sdStar
void graph_sdStar(SCIP *, const GRAPH *, SCIP_Bool, int, int, int *, SCIP_Real *, int *, int *, DHEAP *, STP_Bool *, SCIP_Bool *)
Definition: graph_sdpath.c:1137
graph_addPseudoAncestors
void graph_addPseudoAncestors(int, GRAPH *)
Definition: graph_history.c:1307
graph_heap_deleteMinReturnNode
int graph_heap_deleteMinReturnNode(DHEAP *)
Definition: graph_util.c:1076
graph_sdPaths
void graph_sdPaths(const GRAPH *, PATH *, const SCIP_Real *, SCIP_Real, int *, int *, int *, int *, int, int, int)
Definition: graph_path.c:684
dijkstra_data
Definition: graphdefs.h:311
graph_pseudoAncestors_hashEdgeDirty
void graph_pseudoAncestors_hashEdgeDirty(const PSEUDOANS *, int, SCIP_Bool, SCIP_Bool *, int *)
Definition: graph_history.c:884
graph_writeGmlSub
SCIP_RETCODE graph_writeGmlSub(const GRAPH *, const char *, const SCIP_Bool *)
Definition: graph_save.c:490
graph_free_csr
void graph_free_csr(SCIP *, GRAPH *)
Definition: graph_util.c:1623
graph_voronoi
void graph_voronoi(const GRAPH *, const SCIP_Real *, const SCIP_Real *, const STP_Bool *, int *, PATH *)
Definition: graph_vnoi.c:333
graph_load
SCIP_RETCODE graph_load(SCIP *, GRAPH **, const char *, PRESOL *)
Definition: graph_load.c:885
graph_copy
SCIP_RETCODE graph_copy(SCIP *, const GRAPH *, GRAPH **)
Definition: graph_base.c:939
reducedefs.h
includes reductions definitions and inline methods used for Steiner tree problems ...
graph_getFixpseudonodes
const int * graph_getFixpseudonodes(SCIP *, const GRAPH *)
Definition: graph_history.c:1957
graph_pseudoAncestors_addToNode
SCIP_RETCODE graph_pseudoAncestors_addToNode(SCIP *, int, int, GRAPH *)
Definition: graph_history.c:1545
graph_addPseudoAncestor
void graph_addPseudoAncestor(GRAPH *, int *)
Definition: graph_history.c:1293
graph_getNpseudoAncestors
int graph_getNpseudoAncestors(const GRAPH *)
Definition: graph_history.c:1282
graph_pc_getOrgCostsCsr
void graph_pc_getOrgCostsCsr(SCIP *, const GRAPH *, CSR *)
Definition: graph_pcbase.c:1871
graph_get_nNodes
int graph_get_nNodes(const GRAPH *)
Definition: graph_stats.c:536
pseudo_ancestors
Definition: graph_history.c:52
graph_pc_getOrgCosts
void graph_pc_getOrgCosts(SCIP *, const GRAPH *, SCIP_Real *)
Definition: graph_pcbase.c:1829
graph_pc_knotToFixedTerm
void graph_pc_knotToFixedTerm(SCIP *, GRAPH *, int, SCIP_Real *)
Definition: graph_pcbase.c:1079
graph_pc_nNonFixedTerms
int graph_pc_nNonFixedTerms(const GRAPH *)
Definition: graph_pcbase.c:2549
graph_pc_costsEqualOrgCosts
SCIP_Bool graph_pc_costsEqualOrgCosts(SCIP *, const GRAPH *, const SCIP_Real *)
Definition: graph_pcbase.c:1913
graph_knot_isInRange
SCIP_Bool graph_knot_isInRange(const GRAPH *, int)
Definition: graph_node.c:52
graph_isSetUp
SCIP_Bool graph_isSetUp(const GRAPH *)
Definition: graph_base.c:1240
graph_getTerms
void graph_getTerms(const GRAPH *, int *)
Definition: graph_base.c:567
graph_tpathsGet4CloseTermsLE
void graph_tpathsGet4CloseTermsLE(const GRAPH *, const TPATHS *, int, SCIP_Real, int *RESTRICT, int *RESTRICT, SCIP_Real *RESTRICT, int *RESTRICT)
graph_buildCompleteGraph
SCIP_RETCODE graph_buildCompleteGraph(SCIP *, GRAPH **, int)
Definition: graph_base.c:440
graph_getEdgeRevCosts
void graph_getEdgeRevCosts(const GRAPH *, SCIP_Real *RESTRICT)
graph_save
void graph_save(SCIP *, const GRAPH *, const char *, FILETYPE)
Definition: graph_save.c:370
graph_add1stTermPaths
void graph_add1stTermPaths(const GRAPH *, const SCIP_Real *, PATH *, int *, int *)
Definition: graph_tpath.c:1464
graph_vnoiComputeImplied
SCIP_RETCODE graph_vnoiComputeImplied(SCIP *, const GRAPH *, const SDPROFIT *, VNOI *)
Definition: graph_vnoi.c:1323
special_distance_clique
Definition: graphdefs.h:337
graph_csrdepo_getDataSize
int graph_csrdepo_getDataSize(const CSRDEPO *)
Definition: graph_util.c:709
reduce_costs_data
Definition: redcosts.c:34
graph_init
SCIP_RETCODE graph_init(SCIP *, GRAPH **, int, int, int)
Definition: graph_base.c:607
graph_transRpcGetSpg
SCIP_RETCODE graph_transRpcGetSpg(SCIP *, const GRAPH *, SCIP_Real, SCIP_Real *, int **, GRAPH **)
Definition: graph_trans.c:1217
graph_show
void graph_show(const GRAPH *)
Definition: graph_base.c:1251
graph_get_avgDeg
SCIP_Real graph_get_avgDeg(const GRAPH *)
Definition: graph_stats.c:613
graph_transGstpClean
void graph_transGstpClean(PRESOL *, GRAPH *)
Definition: graph_trans.c:1381
graph_pc_evalTermIsNonLeaf
SCIP_Bool graph_pc_evalTermIsNonLeaf(SCIP *, const GRAPH *, int)
Definition: graph_pcbase.c:1467
graph_subgraphReinsert
SCIP_RETCODE graph_subgraphReinsert(SCIP *, SUBINOUT *, GRAPH *, GRAPH **)
Definition: graph_sub.c:983
graph_pc_getPosPrizeSum
SCIP_Real graph_pc_getPosPrizeSum(SCIP *, const GRAPH *)
Definition: graph_pcbase.c:2091
graph_typeIsSpgLike
SCIP_Bool graph_typeIsSpgLike(const GRAPH *)
Definition: graph_stats.c:57
graph_writeGml
SCIP_RETCODE graph_writeGml(const GRAPH *, const char *, const SCIP_Bool *)
Definition: graph_save.c:441
graph_pseudoAncestors_edgeIsHashed
SCIP_Bool graph_pseudoAncestors_edgeIsHashed(const PSEUDOANS *, int, const int *)
Definition: graph_history.c:948
graph_edge_isBlocked
SCIP_Bool graph_edge_isBlocked(const GRAPH *, int)
Definition: graph_stats.c:94
graph_pc_nonTermToFixedTerm
void graph_pc_nonTermToFixedTerm(GRAPH *, int, SCIP_Real *)
Definition: graph_pcbase.c:1115
graph_transRmw
SCIP_RETCODE graph_transRmw(SCIP *, GRAPH *)
Definition: graph_trans.c:687
graph_pseudoAncestors_appendMoveEdge
SCIP_RETCODE graph_pseudoAncestors_appendMoveEdge(SCIP *, int, int, SCIP_Bool, GRAPH *, SCIP_Bool *)
Definition: graph_history.c:1489
graph_tpathsFree
void graph_tpathsFree(SCIP *, TPATHS **)
Definition: graph_tpath.c:2300
graph_printInfoReduced
void graph_printInfoReduced(const GRAPH *)
Definition: graph_stats.c:375
graph_voronoiWithRadiusMw
void graph_voronoiWithRadiusMw(SCIP *, const GRAPH *, PATH *, const SCIP_Real *, SCIP_Real *, int *, int *, int *)
Definition: graph_vnoi.c:973
graph_heap_correct
void graph_heap_correct(int, SCIP_Real, DHEAP *)
Definition: graph_util.c:1166
graph_csr_buildCosts
void graph_csr_buildCosts(const GRAPH *, const CSR *, const SCIP_Real *, SCIP_Real *RESTRICT)
graph_pc_presolExit
void graph_pc_presolExit(SCIP *, GRAPH *)
Definition: graph_pcbase.c:858
graph_voronoiExtend
SCIP_RETCODE graph_voronoiExtend(SCIP *, const GRAPH *, const SCIP_Real *, PATH *, SCIP_Real **, int **, int **, STP_Bool *, int *, int *, int *, int, int, int)
Definition: graph_vnoi.c:253
graph_path_exists
SCIP_Bool graph_path_exists(const GRAPH *)
Definition: graph_path.c:497
graph_tpathsSetAll2
void graph_tpathsSetAll2(GRAPH *, const SCIP_Real *, const SCIP_Real *, const SDPROFIT *, TPATHS *)
Definition: graph_tpath.c:2180
scip.h
SCIP callable library.
nodes_to_terminal_paths
Definition: graph_tpath.c:61
graph_edge_getAncestors
IDX * graph_edge_getAncestors(const GRAPH *, int)
Definition: graph_history.c:1202
graph_pc_getTwinTerm
int graph_pc_getTwinTerm(const GRAPH *, int)
Definition: graph_pcbase.c:2653
graph_csrdepo_getCSR
void graph_csrdepo_getCSR(const CSRDEPO *, int, CSR *)
Definition: graph_util.c:667
graph_csrdepo_getNcsrs
int graph_csrdepo_getNcsrs(const CSRDEPO *)
Definition: graph_util.c:741