shortest_path Struct Reference

Detailed Description

ONE segment of a path

Definition at line 284 of file graphdefs.h.

#include <graphdefs.h>

Data Fields
SCIP_Real	dist
signed int	edge

Field Documentation

dist

SCIP_Real shortest_path::dist

Definition at line 286 of file graphdefs.h.

Referenced by addToCandidates(), bdkStarStoreMstsCosts(), boundPruneHeur(), boundPruneHeurMw(), computeSteinerTreeVnoi(), extInitRedCostArrays(), extreduce_checkArc(), extTreeGetDirectedRedcostProper(), fixVarsDualcost(), getBoundaryPathCost(), getcloseterms(), getlecloseterms(), getTreeRedcosts_dbg(), graph_findCentralTerminal(), graph_get4nextTTerms(), graph_path_exec(), graph_path_PcMwSd(), graph_path_st_pcmw_extend(), graph_path_st_pcmw_extendBiased(), graph_sdPaths(), graph_tpathsGetClosestTerm(), graph_tpathsPrintForNode(), graph_voronoi(), graph_voronoiExtend(), graph_voronoiMw(), graph_voronoiRepair(), graph_voronoiWithDist(), graph_voronoiWithRadius(), graph_voronoiWithRadiusMw(), reduce_applyPseudoDeletions(), reduce_bd34(), reduce_bound(), reduce_boundHop(), reduce_boundHopR(), reduce_boundHopRc(), reduce_boundMw(), reduce_chain2(), reduce_daSlackPrune(), reduce_extendedCheck3Tree(), reduce_getSdByPaths(), reduce_npv(), reduce_nv(), reduce_nvAdv(), reduce_sdPc(), reduce_sdsp(), reduce_sdspSap(), reduce_sl(), reduceCheckEdge(), reducePcMw(), reduceRootedProb(), sdGetSdPcMw(), sdgraphMstSortCosts(), sdqueryBuildBinaryTree(), termcompDeleteEdges(), termcompMarkPseudoDelNodes(), testEdgeDeletedByCommonRedCostsTargets(), testEdgeDeletion3_deprecated(), tpathsGetDistNew(), tpathsGetKCloseTerms(), updateDeg2LurkingBounds(), updateEdgeFixingBounds(), updateEdgeLurkingBounds(), updateNodeFixingBounds(), updateNodeReplaceBounds(), utdist(), vnoiDataRepairPreprocess(), vnoiDataReset(), and vnoiDataRestore().

edge

signed int shortest_path::edge

Definition at line 287 of file graphdefs.h.

Referenced by blctreeBuildMst(), boundPruneHeur(), computeSteinerTreeVnoi(), createVariables(), extInitRedCostArrays(), getBoundaryPathCostPrized(), getExtBottleneckDist(), graph_path_exec(), graph_path_st_pcmw_extend(), graph_path_st_pcmw_extendBiased(), graph_tpathsGetClosestTerm(), graph_tpathsGetProfitNodes(), graph_voronoi(), graph_voronoiExtend(), graph_voronoiMw(), graph_voronoiWithDist(), graph_voronoiWithRadius(), graph_voronoiWithRadiusMw(), ledgeFromNetgraph(), nodesolGetEdgeSol(), pcsolGetMstEdges(), pricing(), pruneSteinerTreeStp(), reduce_bd34(), reduce_bound(), reduce_boundHop(), reduce_chain2(), reduce_daSlackPrune(), reduce_getSdByPaths(), reduce_npv(), reduce_sd(), reduce_sdsp(), reduce_sdspSap(), SCIPprobdataAddNewSol(), SCIPStpHeurLocalExtendPcMw(), SCIPStpHeurPruneUpdateSols(), SCIPStpHeurTMBuildTree(), SCIPStpHeurTMBuildTreePcMw(), sddeltable(), sdGetSdPcMw(), sdgraphGetSd(), sdgraphMstSortCosts(), sdqueryBuildBinaryTree(), soltreeElimKeyPathsStar(), soltreeExchangeKeyPath(), supergraphComputeMst(), tpathsGetDistNew(), tpathsGetKCloseTerms(), tpathsPrintPath(), tpathsRepairTraverse1st(), tpathsRepairTraverseLevelWithStack(), tpathsRepairTraverseStackAddBelow(), tpathsRepairTraverseStackAddEdge(), tryPathPcMw(), vnoiDataRepairPreprocess(), vnoiDataReset(), and vnoiDataRestore().