-
Notifications
You must be signed in to change notification settings - Fork 0
/
parFindAlmost.hpp
90 lines (73 loc) · 2.82 KB
/
parFindAlmost.hpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
// parFindAlmost.hpp - header file for findAlmostPar.cpp
// and class declarations.
#ifndef PARFINDALMOST_HPP_
#define PARFINDALMOST_HPP_
#include "findAlmost.hpp"
#include <pebbl/parBranching.h>
using namespace pebbl;
void parRefineByMatching(const DenseGraph &g, const DenseGraph &g_fixed, DenseGraph & perg, int B, int* edge_use, bool always_collect_edge_use = false);
class parFindAlmost :
public parallelBranching,
public findAlmost
{
public:
parFindAlmost() {}
~parFindAlmost() {}
void reset(bool VBflag = true){
findAlmost::reset();
registerFirstSolution(new findAlmostSol(this));
parallelBranching::reset();
}
parallelBranchSub* blankParallelSub();
void pack(utilib::PackBuffer& outBuffer);
void unpack(utilib::UnPackBuffer& inBuffer);
int spPackSize();
//will automatically call application serial setup routine
bool setup(int& argc, char**& argv) { return parallelBranching::setup(argc,argv);}
};
class parFindAlmostSub :
public parallelBranchSub,
public findAlmostSub
{
protected:
parFindAlmost* globalPtr;
public:
//int nodes;
parFindAlmost* global() const { return globalPtr; }
parallelBranching* pGlobal() const { return global(); }
//constructor
parFindAlmostSub() {}
~parFindAlmostSub() {
DEBUGPR(600, ucout << "parFindAlmostSub destructor called for " << this
<< " at address " << (void*)this << std::endl); }
void setGlobalInfo(parFindAlmost* global_){
globalPtr = global_;
findAlmostSub::setGlobalInfo(global_);
}
void pack(utilib::PackBuffer& outBuffer);
void unpack(utilib::UnPackBuffer& inBuffer);
void parFindAlmostSubAsChildOf(parFindAlmostSub* parent, int whichChild){
globalPtr = parent->globalPtr;
//initialize other pieces
findAlmostSubAsChildOf(parent,whichChild);
};
parallelBranchSub* makeParallelChild(int whichChild) {
parFindAlmostSub *tmp = new parFindAlmostSub;
DEBUGPR(600, ucout << "new parFindAlmostSub from parFindAlmostSub::makeParallelChild(int), address: " <<(void*) tmp << std::endl);
tmp->parFindAlmostSubAsChildOf(this, whichChild);
return tmp;
}
// in parallel case this wrapper determines if refineByMatching or parRefineByMatching is called
void runRefineByMatching(const DenseGraph &g, const DenseGraph &g_fixed, DenseGraph & perg, int B, int* edge_use, bool always_collect_edge_use = false);
// in parallel case this forces branching decisions to agree when
// the solver is ramping up and there is some randomness in branching
void makeBranchingDecisionsAgree();
//helper fucntion to write to global variables
void testBranchingWriteToGlobal(int refinedByDefaultBranch, std::vector<int> & refinedByFixedBranch) {
if (uMPI::rank == uMPI::ioProc) {
global()->refinedByDefaultBranch = refinedByDefaultBranch;
global()->refinedByFixedBranch = refinedByFixedBranch;
}
}
};
#endif