12 #include <concorde/INCLUDE/cut.h> 23 const std::vector<int> &partition_nodes,
int seed);
37 void expand_cut(CC_GHnode *n, std::vector<int> &cut_nodes);
42 std::vector<std::vector<SimpleTooth>> light_teeth;
46 const std::vector<int> &perm;
48 std::vector<SimpleTooth*> cutgraph_nodes;
50 std::vector<int> cut_elist;
51 std::vector<double> cut_ecap;
52 std::vector<int> odd_nodes_list;
53 std::vector<bool> node_marks;
58 const int random_seed;
Support graph data for an LP solution.
Definition: datagroups.hpp:174
Class for building miniature simple DP witness cutgraphs.
Definition: witness.hpp:19
DPwitness(CandidateTeeth &cands, const std::vector< int > &partition_nodes, int seed)
Construct a mini cutgraph induced by a partition.
Definition: witness.cpp:24
void expand_cut(CC_GHnode *n, std::vector< int > &cut_nodes)
Expand a Gomory-Hu node into a cut.
Definition: witness.cpp:300
bool simple_DP_sep(CutQueue< dominoparity > &domino_q)
Create a cutgraph and grab odd cuts from it.
Definition: witness.cpp:45
Class template for queue of cuts in some form.
Definition: process_cuts.hpp:30
void dfs_odd_cuts(CC_GHnode *n)
Search tree for odd cuts.
Definition: witness.cpp:288
void grab_dominos(CutQueue< dominoparity > &domino_q)
Get simple DP inequalities from fundamental cuts of the GH tree.
Definition: witness.cpp:215
void build_gh_tree()
Construct the Gomory-Hu tree.
Definition: witness.cpp:194
Structures for storing and processing cuts.
void build_light_tree()
Build the tooth inequality tree.
Definition: witness.cpp:64
The namespace for this project.
Definition: abc_nodesel.hpp:20
void add_web_edges()
Add nonnegativity inequality edges.
Definition: witness.cpp:155