|
|
Definition at line 55 of file grph.h.
#include <grph.h>
list of ancestor edges to each edge (to keep track of reductions)
Definition at line 83 of file grph.h.
Referenced by bd3_reduction(), bdr_reduction(), bound_reduce(), da_reduce(), degree_test(), degree_test_pc(), degree_test_sap(), graph_edge_del(), graph_edge_reinsert(), graph_free(), graph_init(), graph_init_history(), graph_knot_contract(), graph_knot_contractpc(), graph_pack(), nv_reduction(), nv_reductionAdv(), pcgraphtrans(), rptReduction(), SCIP_DECL_HEUREXEC(), SCIPprobdataWriteSolution(), sl_reduction(), traverseChain(), and trydg1edgepc().
Array [0..edges-1] of positiv edge costs
Definition at line 91 of file grph.h.
Referenced by bd3_reduction(), bdr_reduction(), bea_save(), bound_reduce(), buildsolgraph(), createVariables(), da_reduce(), daPc_reduce(), degree_test(), degree_test_hc(), degree_test_mw(), degree_test_pc(), degree_test_sap(), do_prizecoll_trivial(), extendSteinerTreePcMw(), getRSD(), getSD(), graph_copy(), graph_edge_add(), graph_edge_redirect(), graph_free(), graph_ident(), graph_init(), graph_knot_contract(), graph_knot_contractpc(), graph_load(), graph_maxweight_transform(), graph_MwcsToSap(), graph_pack(), graph_path_length(), graph_PcSapCopy(), graph_resize(), graph_show(), hcrbound_reduce(), hcrcbound_reduce(), hopbound_reduce(), ledge_reduction(), nodeIsCrucial(), npvReduction(), nv_reduction(), nv_reductionAdv(), nvsl_reduction(), pcgraphtrans(), prize_subtract(), probdataPrintGraph(), prune(), reduceSap(), rptReduction(), SCIP_DECL_HEUREXEC(), SCIP_DECL_PARAMCHGD(), SCIPdualAscentPcStp(), SCIPdualAscentStp(), SCIPheurComputeSteinerTree(), SCIPheurImproveSteinerTree(), SCIPprobdataAddNewSol(), SCIPprobdataPrintGraph2(), SCIPwriteStp(), sd2_reduction(), sd_red(), sd_reduction(), sddeltable(), sdpc_reduction(), sdsp_reduction(), sdsp_sap_reduction(), sl_reduction(), stp_save(), traverseChain(), trydg1edgepc(), voronoi_dist(), and voronoi_radius().
Count of edges in the graph
Definition at line 89 of file grph.h.
Referenced by bd3_reduction(), bea_save(), bound_reduce(), buildsolgraph(), central_terminal(), computeDegConsTree(), computeSteinerTreeVnoi(), createPrizeConstraints(), createVariables(), cut_add(), da_reduce(), daPc_reduce(), degree_test_mw(), extendSteinerTreePcMw(), graph_copy(), graph_edge_add(), graph_free(), graph_ident(), graph_init(), graph_init_history(), graph_load(), graph_mincut_exec(), graph_mincut_init(), graph_pack(), graph_PcSapCopy(), graph_PcToSap(), graph_prize_transform(), graph_resize(), graph_rootprize_transform(), graph_show(), graph_uncover(), graph_valid(), hcrbound_reduce(), hcrcbound_reduce(), hopbound_reduce(), initialise(), ledge_reduction(), nail(), nodeIsCrucial(), nvsl_reduction(), pcgraphtrans(), probdataPrintGraph(), prune(), reduceHc(), reduceMwcs(), reducePc(), reduceSap(), reduceStp(), reinitialise(), SCIP_DECL_EVENTEXEC(), SCIP_DECL_HEUREXEC(), SCIP_DECL_PARAMCHGD(), SCIP_DECL_PROPEXEC(), SCIPdualAscentAddCutsStp(), SCIPdualAscentPcStp(), SCIPdualAscentStp(), SCIPheurComputeSteinerTree(), SCIPheurImproveSteinerTree(), SCIPheurPruneSteinerTree(), SCIPprobdataCreate(), SCIPprobdataPrintGraph2(), SCIPprobdataWriteSolution(), SCIPvalidateStpSol(), SCIPwriteStp(), sd_red(), sd_reduction(), sdpc_reduction(), sdsp_sap_reduction(), selectdiffsols(), sep_2cut(), sep_flow(), set_capacity(), stp_save(), and voronoi_dist().
list of fixed edges
Definition at line 82 of file grph.h.
Referenced by bd3_reduction(), degree_test(), degree_test_sap(), graph_free(), graph_init(), graph_pack(), nv_reduction(), nv_reductionAdv(), pcgraphtrans(), rptReduction(), SCIP_DECL_HEUREXEC(), SCIPprobdataWriteSolution(), and sl_reduction().
Array [0..nodes-1] with degree of knot [i]
Definition at line 74 of file grph.h.
Referenced by ansadv2Reduction(), ansadvReduction(), ansReduction(), bd3_reduction(), bdr_reduction(), bound_reduce(), central_terminal(), chain2Reduction(), cnsAdvReduction(), compute_sd(), computeDegConsTree(), computeSteinerTree(), computeSteinerTreeDijk(), computeSteinerTreeVnoi(), da_reduce(), daPc_reduce(), degree_test(), degree_test_mw(), degree_test_pc(), degree_test_sap(), deleteterm(), getnext3terms(), getnext4terms(), getnext4tterms(), graph_copy(), graph_edge_add(), graph_edge_del(), graph_edge_hide(), graph_edge_redirect(), graph_free(), graph_ident(), graph_init(), graph_knot_add(), graph_knot_contract(), graph_knot_contractpc(), graph_load(), graph_pack(), graph_path_st(), graph_resize(), graph_show(), graph_uncover(), graph_valid(), hcrbound_reduce(), hcrcbound_reduce(), hopbound_reduce(), ledge_reduction(), level0(), maxprize(), npvReduction(), nv_reduction(), nv_reductionAdv(), nvsl_reduction(), pcgraphorg(), pcgraphtrans(), rptReduction(), SCIP_DECL_HEUREXEC(), SCIP_DECL_PROPEXEC(), SCIPdualAscentAddCutsStp(), SCIPdualAscentPcStp(), SCIPdualAscentStp(), SCIPheurComputeSteinerTree(), SCIPheurImproveSteinerTree(), SCIPvalidateStpSol(), sd2_reduction(), sd_red(), sd_reduction(), sdpaths(), sdpc_reduction(), sdsp_reduction(), sdsp_sap_reduction(), sl_reduction(), traverseChain(), and trydg1edgepc().
| int** GRAPH::grid_coordinates |
Array [0..edges-1] of node-number of head of edge [i]
Definition at line 94 of file grph.h.
Referenced by ansadv2Reduction(), ansadvReduction(), ansReduction(), bd3_reduction(), bdr_reduction(), bea_save(), bfs(), bound_reduce(), buildsolgraph(), chain2Reduction(), cnsAdvReduction(), compTMstarts(), compute_sd(), computeDegConsTree(), computeSteinerTreeVnoi(), createPrizeConstraints(), createVariables(), cut_add(), da_reduce(), daPc_reduce(), degree_test(), degree_test_mw(), degree_test_pc(), degree_test_sap(), deleteterm(), dfsorder(), do_prizecoll_trivial(), edge_remove(), extendSteinerTreePcMw(), get2next(), get3next(), get4next(), getnext4tterms(), getRSD(), getSD(), graph_copy(), graph_edge_add(), graph_edge_del(), graph_edge_hide(), graph_edge_redirect(), graph_free(), graph_ident(), graph_init(), graph_init_history(), graph_knot_contract(), graph_knot_contractpc(), graph_mincut_exec(), graph_pack(), graph_path_exec(), graph_path_execX(), graph_path_st(), graph_resize(), graph_show(), graph_sol_valid(), graph_trail(), graph_uncover(), graph_valid(), graph_valid2(), hcrbound_reduce(), hcrcbound_reduce(), hopbound_reduce(), initialise(), lca(), ledge_reduction(), nnpReduction(), nodeIsCrucial(), npvReduction(), nv_reduction(), nv_reductionAdv(), nvsl_reduction(), pcgraphtrans(), prize_subtract(), probdataPrintGraph(), reinitialise(), SCIP_DECL_HEUREXEC(), SCIP_DECL_PARAMCHGD(), SCIP_DECL_PROPEXEC(), SCIPdualAscentPcStp(), SCIPheurComputeSteinerTree(), SCIPheurImproveSteinerTree(), SCIPheurPruneDegConsSteinerTree(), SCIPheurPrunePCSteinerTree(), SCIPheurPruneSteinerTree(), SCIPprobdataPrintGraph2(), SCIPprobdataWriteSolution(), SCIPwriteStp(), sd2_reduction(), sd_red(), sd_reduction(), sddeltable(), sdpaths(), sdpc_reduction(), sdsp_reduction(), sdsp_sap_reduction(), selectdiffsols(), sl_reduction(), stp_save(), trail(), traverseChain(), trydg1edgepc(), voronoi(), voronoi_dist(), voronoi_extend(), voronoi_extend2(), voronoi_radius(), voronoi_repair(), voronoi_repair_mult(), voronoi_slrepair(), voronoi_terms(), and voronoiSteinerTreeExt().
maximal number of edges allowed for a solution to be feasible (only used for HCDSTPs)
Definition at line 86 of file grph.h.
Referenced by bd3_reduction(), buildsolgraph(), createHopConstraint(), graph_copy(), graph_init(), graph_load(), graph_pack(), hcrbound_reduce(), hopbound_reduce(), pcgraphtrans(), SCIP_DECL_HEUREXEC(), SCIPheurComputeSteinerTree(), and SCIPwriteStp().
Array [0..edges-1], incoming edge allocation table
Definition at line 99 of file grph.h.
Referenced by bd3_reduction(), bea_save(), buildsolgraph(), createVariables(), degree_test(), degree_test_hc(), degree_test_mw(), degree_test_pc(), degree_test_sap(), do_prizecoll_trivial(), edge_remove(), graph_copy(), graph_edge_add(), graph_edge_del(), graph_edge_hide(), graph_edge_redirect(), graph_free(), graph_ident(), graph_init(), graph_knot_contract(), graph_knot_contractpc(), graph_load(), graph_maxweight_transform(), graph_MwcsToSap(), graph_pack(), graph_resize(), graph_show(), graph_uncover(), graph_valid(), hcrcbound_reduce(), nvsl_reduction(), pcgraphtrans(), prize_subtract(), rptReduction(), SCIP_DECL_BRANCHEXECLP(), SCIPdualAscentPcStp(), SCIPdualAscentStp(), SCIPheurImproveSteinerTree(), SCIPheurPruneDegConsSteinerTree(), SCIPheurPrunePCSteinerTree(), SCIPheurPruneSteinerTree(), SCIPprobdataAddNewSol(), SCIPwriteStp(), sd_red(), sddeltable(), selectBranchingVertex(), sep_flow(), stp_save(), and trydg1edgepc().
Array [0..nodes-1] with starting slot index for the ieat array, -1 if not used
Definition at line 75 of file grph.h.
Referenced by bd3_reduction(), buildsolgraph(), createVariables(), degree_test(), degree_test_hc(), degree_test_mw(), degree_test_pc(), degree_test_sap(), do_prizecoll_trivial(), edge_remove(), graph_copy(), graph_edge_add(), graph_edge_redirect(), graph_free(), graph_ident(), graph_init(), graph_knot_add(), graph_knot_contract(), graph_knot_contractpc(), graph_load(), graph_maxweight_transform(), graph_MwcsToSap(), graph_resize(), graph_show(), graph_uncover(), graph_valid(), hcrcbound_reduce(), level0(), nnpReduction(), prize_subtract(), rptReduction(), SCIP_DECL_BRANCHEXECLP(), SCIPdualAscentPcStp(), SCIPdualAscentStp(), SCIPheurImproveSteinerTree(), SCIPheurPruneDegConsSteinerTree(), SCIPheurPrunePCSteinerTree(), SCIPheurPruneSteinerTree(), SCIPprobdataAddNewSol(), selectBranchingVertex(), sep_flow(), and trydg1edgepc().
Count of nodes in graph
Definition at line 61 of file grph.h.
Referenced by ansadv2Reduction(), ansadvReduction(), ansReduction(), bd3_reduction(), bdr_reduction(), bea_save(), bfs(), bound_reduce(), buildsolgraph(), central_terminal(), chain2Reduction(), cnsAdvReduction(), compTMstarts(), compute_sd(), computeDegConsTree(), computeSteinerTree(), computeSteinerTreeDijk(), computeSteinerTreeVnoi(), createPrizeConstraints(), createVariables(), da_reduce(), daPc_reduce(), degree_test(), degree_test_hc(), degree_test_mw(), degree_test_pc(), degree_test_sap(), extendSteinerTreePcMw(), get2next(), get3next(), get4next(), getnext3terms(), getnext4terms(), getnext4tterms(), getRSD(), getSD(), graph_copy(), graph_ident(), graph_init(), graph_init_history(), graph_knot_add(), graph_load(), graph_maxweight_transform(), graph_mincut_exec(), graph_mincut_init(), graph_MwcsToSap(), graph_pack(), graph_path_exec(), graph_path_execX(), graph_path_init(), graph_path_length(), graph_path_st(), graph_PcSapCopy(), graph_PcToSap(), graph_prize_transform(), graph_resize(), graph_rootprize_transform(), graph_show(), graph_sol_valid(), graph_valid(), graph_valid2(), hcrbound_reduce(), hcrcbound_reduce(), hopbound_reduce(), initialise(), ledge_reduction(), level0(), maxprize(), nnpReduction(), nodeIsCrucial(), npvReduction(), nv_reduction(), nv_reductionAdv(), nvsl_reduction(), pcgraphorg(), pcgraphtrans(), pricing(), probdataPrintGraph(), reduceHc(), reduceMwcs(), reducePc(), reduceSap(), reduceStp(), reinitialise(), rptReduction(), SCIP_DECL_CONSPROP(), SCIP_DECL_EVENTEXEC(), SCIP_DECL_HEUREXEC(), SCIP_DECL_PARAMCHGD(), SCIP_DECL_PROPEXEC(), SCIPdualAscentAddCutsStp(), SCIPdualAscentPcStp(), SCIPdualAscentStp(), SCIPheurComputeSteinerTree(), SCIPheurImproveSteinerTree(), SCIPheurPruneDegConsSteinerTree(), SCIPheurPrunePCSteinerTree(), SCIPheurPruneSteinerTree(), SCIPprobdataAddNewSol(), SCIPprobdataCreate(), SCIPprobdataPrintGraph2(), SCIPvalidateStpSol(), SCIPwriteStp(), sd2_reduction(), sd_red(), sd_reduction(), sdpc_reduction(), sdsp_reduction(), sdsp_sap_reduction(), selectBranchingVertex(), sep_2cut(), sep_flow(), sl_reduction(), stp_save(), trail(), voronoi(), voronoi_dist(), voronoi_extend(), voronoi_extend2(), voronoi_radius(), voronoi_repair(), voronoi_repair_mult(), voronoi_slrepair(), voronoi_terms(), and voronoiSteinerTreeExt().
Count of different networks
Definition at line 64 of file grph.h.
Referenced by central_terminal(), graph_copy(), graph_init(), graph_knot_contract(), graph_pack(), graph_resize(), graph_valid(), nail(), nvsl_reduction(), pcgraphtrans(), SCIPheurComputeSteinerTree(), SCIPprobdataCreate(), SCIPvalidateStpSol(), sep_2cut(), and sep_flow().
Array [0..nodes-1], normaly TRUE or FALSE to mark nodes for inclusion in the shortest path / minimum spanning tree routine
Definition at line 71 of file grph.h.
Referenced by ansadv2Reduction(), ansadvReduction(), ansReduction(), bd3_reduction(), bdr_reduction(), bound_reduce(), central_terminal(), chain2Reduction(), cnsAdvReduction(), compTMstarts(), compute_sd(), computeDegConsTree(), computeSteinerTree(), computeSteinerTreeDijk(), computeSteinerTreeVnoi(), createVariables(), cut_add(), da_reduce(), daPc_reduce(), degree_test_mw(), degree_test_pc(), degree_test_sap(), deleteterm(), get2next(), get3next(), get4next(), getnext3terms(), getnext4terms(), getnext4tterms(), graph_copy(), graph_free(), graph_init(), graph_knot_add(), graph_knot_contractpc(), graph_path_exec(), graph_path_execX(), graph_path_st(), graph_resize(), graph_trail(), graph_valid(), hcrbound_reduce(), hcrcbound_reduce(), hopbound_reduce(), ledge_reduction(), level0(), maxprize(), nnpReduction(), npvReduction(), nv_reduction(), nv_reductionAdv(), nvsl_reduction(), pcgraphorg(), pcgraphtrans(), pricing(), prize_subtract(), SCIP_DECL_PROPEXEC(), SCIPdualAscentPcStp(), SCIPdualAscentStp(), SCIPheurComputeSteinerTree(), SCIPheurImproveSteinerTree(), SCIPheurPrunePCSteinerTree(), SCIPheurPruneSteinerTree(), SCIPprobdataAddNewSol(), SCIPprobdataPrintGraph2(), sd2_reduction(), sd_red(), sd_reduction(), sdpaths(), sdpc_reduction(), sdsp_reduction(), sdsp_sap_reduction(), sep_2cut(), sl_reduction(), traverseChain(), trydg1edgepc(), voronoi_dist(), voronoi_extend(), voronoi_extend2(), voronoi_radius(), voronoi_repair(), voronoi_repair_mult(), voronoi_slrepair(), and voronoi_terms().
Array [0..nodes-1] containing the maximal degrees of all nodes (only used for HCDSTPs)
Definition at line 79 of file grph.h.
Referenced by buildsolgraph(), computeDegConsTree(), createDegreeConstraints(), graph_copy(), graph_free(), graph_init(), graph_load(), graph_pack(), pcgraphtrans(), SCIP_DECL_CONSPROP(), SCIP_DECL_HEUREXEC(), and SCIPvalidateStpSol().
| int GRAPH::norgmodeledges |
| int GRAPH::norgmodelknots |
Array [0..edges-1], outgoing edge allocation table
Definition at line 100 of file grph.h.
Referenced by ansadv2Reduction(), ansadvReduction(), ansReduction(), bd3_reduction(), bdr_reduction(), bea_save(), bfs(), bound_reduce(), buildsolgraph(), chain2Reduction(), cnsAdvReduction(), compute_sd(), computeDegConsTree(), computeSteinerTreeVnoi(), createVariables(), da_reduce(), daPc_reduce(), degree_test(), degree_test_hc(), degree_test_mw(), degree_test_pc(), degree_test_sap(), dfsorder(), do_prizecoll_trivial(), edge_remove(), extendSteinerTreePcMw(), get2next(), get3next(), get4next(), getnext4tterms(), getRSD(), getSD(), graph_copy(), graph_edge_add(), graph_edge_del(), graph_edge_hide(), graph_edge_redirect(), graph_free(), graph_ident(), graph_init(), graph_knot_contract(), graph_knot_contractpc(), graph_mincut_exec(), graph_pack(), graph_path_exec(), graph_path_execX(), graph_path_st(), graph_resize(), graph_show(), graph_sol_valid(), graph_trail(), graph_uncover(), graph_valid(), graph_valid2(), hcrbound_reduce(), hcrcbound_reduce(), hopbound_reduce(), initialise(), lca(), ledge_reduction(), nnpReduction(), nodeIsCrucial(), npvReduction(), nv_reduction(), nv_reductionAdv(), nvsl_reduction(), pcgraphtrans(), prize_subtract(), SCIP_DECL_HEUREXEC(), SCIP_DECL_PROPEXEC(), SCIPdualAscentPcStp(), SCIPheurComputeSteinerTree(), SCIPheurImproveSteinerTree(), SCIPheurPruneDegConsSteinerTree(), SCIPheurPrunePCSteinerTree(), SCIPheurPruneSteinerTree(), SCIPprobdataPrintGraph2(), SCIPvalidateStpSol(), SCIPwriteStp(), sd2_reduction(), sd_red(), sd_reduction(), sddeltable(), sdpaths(), sdpc_reduction(), sdsp_reduction(), sdsp_sap_reduction(), sep_flow(), sl_reduction(), stp_save(), trail(), traverseChain(), trydg1edgepc(), voronoi(), voronoi_dist(), voronoi_extend(), voronoi_extend2(), voronoi_radius(), voronoi_repair(), voronoi_repair_mult(), voronoi_slrepair(), voronoi_terms(), and voronoiSteinerTreeExt().
Array [0..nodes-1] with starting slot index for the oeat array, -1 if not used
Definition at line 77 of file grph.h.
Referenced by ansadv2Reduction(), ansadvReduction(), ansReduction(), bd3_reduction(), bdr_reduction(), bfs(), bound_reduce(), buildsolgraph(), chain2Reduction(), cnsAdvReduction(), compTMstarts(), compute_sd(), computeDegConsTree(), computeSteinerTreeVnoi(), createVariables(), da_reduce(), daPc_reduce(), degree_test(), degree_test_hc(), degree_test_mw(), degree_test_pc(), degree_test_sap(), deleteterm(), dfsorder(), do_prizecoll_trivial(), edge_remove(), extendSteinerTreePcMw(), get2next(), get3next(), get4next(), getnext4tterms(), getRSD(), getSD(), graph_copy(), graph_edge_add(), graph_edge_redirect(), graph_free(), graph_ident(), graph_init(), graph_knot_add(), graph_knot_contract(), graph_knot_contractpc(), graph_mincut_exec(), graph_path_exec(), graph_path_execX(), graph_path_st(), graph_resize(), graph_show(), graph_sol_valid(), graph_trail(), graph_uncover(), graph_valid(), graph_valid2(), hcrbound_reduce(), hcrcbound_reduce(), hopbound_reduce(), initialise(), lca(), ledge_reduction(), nnpReduction(), nodeIsCrucial(), npvReduction(), nv_reduction(), nv_reductionAdv(), nvsl_reduction(), prize_subtract(), SCIP_DECL_HEUREXEC(), SCIP_DECL_PROPEXEC(), SCIPdualAscentPcStp(), SCIPdualAscentStp(), SCIPheurComputeSteinerTree(), SCIPheurImproveSteinerTree(), SCIPheurPruneDegConsSteinerTree(), SCIPheurPrunePCSteinerTree(), SCIPheurPruneSteinerTree(), SCIPvalidateStpSol(), SCIPwriteStp(), sd2_reduction(), sd_red(), sd_reduction(), sddeltable(), sdpaths(), sdpc_reduction(), sdsp_reduction(), sdsp_sap_reduction(), sep_flow(), sl_reduction(), trail(), traverseChain(), trydg1edgepc(), voronoi(), voronoi_dist(), voronoi_extend(), voronoi_extend2(), voronoi_radius(), voronoi_repair(), voronoi_repair_mult(), voronoi_slrepair(), voronoi_terms(), and voronoiSteinerTreeExt().
Definition at line 114 of file grph.h.
Referenced by computeSteinerTreeVnoi(), da_reduce(), daPc_reduce(), graph_init(), graph_path_exec(), graph_path_execX(), graph_path_exit(), graph_path_init(), graph_path_st(), SCIP_DECL_PROPEXEC(), SCIPheurImproveSteinerTree(), voronoi(), voronoi_extend(), voronoi_extend2(), voronoi_repair(), voronoi_repair_mult(), and voronoiSteinerTreeExt().
Definition at line 115 of file grph.h.
Referenced by bound_reduce(), computeSteinerTreeVnoi(), daPc_reduce(), graph_init(), graph_path_exec(), graph_path_execX(), graph_path_exit(), graph_path_init(), graph_path_st(), hopbound_reduce(), ledge_reduction(), SCIP_DECL_PROPEXEC(), SCIPheurImproveSteinerTree(), SCIPheurPrunePCSteinerTree(), voronoi(), voronoi_extend(), voronoi_extend2(), voronoi_repair(), voronoi_repair_mult(), and voronoiSteinerTreeExt().
Array [0..edges-1] of positiv node costs
Definition at line 92 of file grph.h.
Referenced by ansadv2Reduction(), ansadvReduction(), ansReduction(), bound_reduce(), buildsolgraph(), chain2Reduction(), cnsAdvReduction(), degree_test_mw(), degree_test_pc(), extendSteinerTreePcMw(), getSD(), graph_copy(), graph_free(), graph_init(), graph_knot_contractpc(), graph_load(), graph_maxweight_transform(), graph_MwcsToSap(), graph_pack(), graph_PcSapCopy(), graph_PcToSap(), graph_prize_transform(), graph_rootprize_transform(), maxprize(), nnpReduction(), npvReduction(), nv_reduction(), nv_reductionAdv(), prize_subtract(), reduceMwcs(), reducePc(), SCIPheurImproveSteinerTree(), sd2_reduction(), sdpc_reduction(), sdsp_reduction(), sl_reduction(), traverseChain(), trydg1edgepc(), voronoi_radius(), and voronoiSteinerTreeExt().
Array [0..layers-1] of knot number of the root of network [i], -1 if unknown
Definition at line 67 of file grph.h.
Referenced by bd3_reduction(), bound_reduce(), buildsolgraph(), central_terminal(), compTMstarts(), computeSteinerTree(), computeSteinerTreeVnoi(), createConstraints(), createPrizeConstraints(), createVariables(), cut_add(), da_reduce(), daPc_reduce(), degree_test_hc(), degree_test_mw(), degree_test_pc(), degree_test_sap(), deleteterm(), do_prizecoll_trivial(), extendSteinerTreePcMw(), get2next(), get3next(), get4next(), graph_copy(), graph_free(), graph_grid_create(), graph_init(), graph_knot_contract(), graph_knot_contractpc(), graph_load(), graph_obstgrid_create(), graph_pack(), graph_PcSapCopy(), graph_PcToSap(), graph_prize_transform(), graph_resize(), graph_rootprize_transform(), graph_sol_valid(), graph_valid(), graph_valid2(), hcrbound_reduce(), hcrcbound_reduce(), hopbound_reduce(), ledge_reduction(), level0(), maxprize(), nodeIsCrucial(), nv_reduction(), nv_reductionAdv(), nvsl_reduction(), pcgraphorg(), pcgraphtrans(), prize_subtract(), probdataPrintGraph(), rptReduction(), SCIP_DECL_HEUREXEC(), SCIP_DECL_PARAMCHGD(), SCIP_DECL_PROPEXEC(), SCIPdualAscentAddCutsStp(), SCIPdualAscentPcStp(), SCIPdualAscentStp(), SCIPheurComputeSteinerTree(), SCIPheurImproveSteinerTree(), SCIPheurPruneDegConsSteinerTree(), SCIPheurPrunePCSteinerTree(), SCIPheurPruneSteinerTree(), SCIPprobdataAddNewSol(), SCIPprobdataCreate(), SCIPprobdataGetRoot(), SCIPprobdataPrintGraph2(), SCIPprobdataWriteSolution(), SCIPvalidateStpSol(), SCIPwriteStp(), sd_red(), sd_reduction(), sdpc_reduction(), sep_2cut(), sep_flow(), sl_reduction(), trail(), trydg1edgepc(), voronoi(), and voronoi_radius().
Definition at line 123 of file grph.h.
Referenced by ansadv2Reduction(), ansadvReduction(), ansReduction(), bd3_reduction(), bdr_reduction(), bound_reduce(), buildsolgraph(), cnsAdvReduction(), computeSteinerTree(), createPrizeConstraints(), createVariables(), da_reduce(), degree_test_hc(), degree_test_mw(), degree_test_pc(), extendSteinerTreePcMw(), getnext3terms(), getnext4terms(), getnext4tterms(), graph_copy(), graph_free(), graph_grid_create(), graph_init(), graph_init_history(), graph_knot_contractpc(), graph_load(), graph_maxweight_transform(), graph_MwcsToSap(), graph_obstgrid_create(), graph_pack(), graph_PcSapCopy(), graph_PcToSap(), graph_prize_transform(), graph_rootprize_transform(), graph_valid(), nnpReduction(), nv_reduction(), nv_reductionAdv(), nvsl_reduction(), pcgraphorg(), pcgraphtrans(), prize_subtract(), probdataCreate(), prune(), reducePc(), SCIP_DECL_CONSPROP(), SCIP_DECL_EVENTEXEC(), SCIP_DECL_HEUREXEC(), SCIP_DECL_HEURINIT(), SCIP_DECL_PROPEXEC(), SCIPheurComputeSteinerTree(), SCIPheurImproveSteinerTree(), SCIPheurPrunePCSteinerTree(), SCIPheurPruneSteinerTree(), SCIPprobdataAddNewSol(), SCIPprobdataCreate(), SCIPprobdataWriteSolution(), SCIPvalidateStpSol(), SCIPwriteStp(), sd2_reduction(), sd_reduction(), sdpaths(), sdsp_reduction(), sep_2cut(), sl_reduction(), trydg1edgepc(), and voronoi_radius().
Array [0..edges-1] of node-number of tail of edge [i]
Definition at line 93 of file grph.h.
Referenced by bd3_reduction(), bdr_reduction(), bea_save(), bound_reduce(), buildsolgraph(), computeDegConsTree(), computeSteinerTree(), computeSteinerTreeVnoi(), createVariables(), cut_add(), degree_test_mw(), degree_test_pc(), degree_test_sap(), do_prizecoll_trivial(), edge_remove(), extendSteinerTreePcMw(), getnext4tterms(), getRSD(), graph_copy(), graph_edge_add(), graph_edge_del(), graph_edge_hide(), graph_edge_redirect(), graph_free(), graph_ident(), graph_init(), graph_init_history(), graph_knot_contract(), graph_knot_contractpc(), graph_load(), graph_mincut_exec(), graph_pack(), graph_path_st(), graph_resize(), graph_show(), graph_uncover(), graph_valid(), hopbound_reduce(), ledge_reduction(), nodeIsCrucial(), nv_reduction(), nv_reductionAdv(), nvsl_reduction(), pcgraphtrans(), pricing(), prize_subtract(), probdataPrintGraph(), reinitialise(), rptReduction(), SCIP_DECL_HEUREXEC(), SCIP_DECL_PARAMCHGD(), SCIPdualAscentPcStp(), SCIPdualAscentStp(), SCIPheurComputeSteinerTree(), SCIPheurImproveSteinerTree(), SCIPheurPrunePCSteinerTree(), SCIPprobdataAddNewSol(), SCIPprobdataPrintGraph2(), SCIPprobdataWriteSolution(), SCIPwriteStp(), sd_red(), sd_reduction(), sddeltable(), sdpc_reduction(), selectdiffsols(), sl_reduction(), stp_save(), trail(), trydg1edgepc(), voronoi_dist(), voronoi_radius(), and voronoi_repair().
Array [0..nodes-1] of networknumber for knot [i], -1 if [i] is never a terminal
Definition at line 69 of file grph.h.
Referenced by ansadv2Reduction(), ansadvReduction(), bd3_reduction(), bdr_reduction(), bea_save(), bound_reduce(), buildsolgraph(), central_terminal(), chain2Reduction(), cnsAdvReduction(), compTMstarts(), compute_sd(), computeDegConsTree(), computeSteinerTree(), computeSteinerTreeVnoi(), createConstraints(), createVariables(), da_reduce(), daPc_reduce(), degree_test(), degree_test_hc(), degree_test_mw(), degree_test_pc(), degree_test_sap(), deleteterm(), do_prizecoll_trivial(), extendSteinerTreePcMw(), get2next(), get3next(), get4next(), getnext4tterms(), getRSD(), getSD(), graph_copy(), graph_free(), graph_ident(), graph_init(), graph_knot_add(), graph_knot_chg(), graph_knot_contract(), graph_knot_contractpc(), graph_load(), graph_maxweight_transform(), graph_MwcsToSap(), graph_pack(), graph_path_execX(), graph_path_st(), graph_PcSapCopy(), graph_PcToSap(), graph_prize_transform(), graph_resize(), graph_rootprize_transform(), graph_show(), graph_sol_valid(), graph_valid(), graph_valid2(), hcrbound_reduce(), hcrcbound_reduce(), hopbound_reduce(), ledge_reduction(), level0(), maxprize(), nodeIsCrucial(), npvReduction(), nv_reduction(), nv_reductionAdv(), nvsl_reduction(), pcgraphorg(), pcgraphtrans(), prize_subtract(), probdataPrintGraph(), rptReduction(), SCIP_DECL_CONSPROP(), SCIP_DECL_HEUREXEC(), SCIP_DECL_PARAMCHGD(), SCIP_DECL_PROPEXEC(), SCIPdualAscentAddCutsStp(), SCIPdualAscentPcStp(), SCIPdualAscentStp(), SCIPheurComputeSteinerTree(), SCIPheurImproveSteinerTree(), SCIPheurPruneDegConsSteinerTree(), SCIPheurPrunePCSteinerTree(), SCIPheurPruneSteinerTree(), SCIPprobdataAddNewSol(), SCIPprobdataCreate(), SCIPprobdataPrintGraph2(), SCIPprobdataWriteSolution(), SCIPvalidateStpSol(), SCIPwriteStp(), sd2_reduction(), sd_red(), sd_reduction(), sddeltable(), sdpaths(), sdpc_reduction(), sdsp_reduction(), selectBranchingVertex(), selectdiffsols(), sep_2cut(), sep_flow(), sl_reduction(), stp_save(), traverseChain(), trydg1edgepc(), utdist(), voronoi_dist(), voronoi_extend2(), voronoi_radius(), voronoi_slrepair(), voronoi_terms(), and voronoiSteinerTreeExt().
Count of terminals
Definition at line 63 of file grph.h.
Referenced by bd3_reduction(), bea_save(), bound_reduce(), compTMstarts(), computeDegConsTree(), computeSteinerTreeVnoi(), createPrizeConstraints(), da_reduce(), daPc_reduce(), graph_copy(), graph_init(), graph_knot_add(), graph_knot_chg(), graph_load(), graph_maxweight_transform(), graph_MwcsToSap(), graph_pack(), graph_path_st(), graph_PcSapCopy(), graph_PcToSap(), graph_prize_transform(), graph_rootprize_transform(), graph_sol_valid(), graph_valid(), graph_valid2(), nv_reduction(), nv_reductionAdv(), pcgraphtrans(), reduceMwcs(), reducePc(), reduceStp(), SCIP_DECL_HEUREXEC(), SCIPdualAscentAddCutsStp(), SCIPdualAscentPcStp(), SCIPdualAscentStp(), SCIPheurComputeSteinerTree(), SCIPheurPruneSteinerTree(), SCIPprobdataCreate(), SCIPprobdataWriteSolution(), SCIPwriteStp(), sd_red(), sdpc_reduction(), sep_2cut(), stp_save(), and voronoi_radius().
|
