Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
conclass.h
Go to the documentation of this file.
1
30#pragma once
31
33
34#pragma GCC visibility push(default)
35namespace abacus {
36
37
39
46public:
47
58 const Master *master,
59 bool discrete,
60 bool allVarBinary,
61 bool trivial,
62 bool bound,
63 bool varBound)
64 :
65 discrete_(discrete),
66 allVarBinary_(allVarBinary),
67 trivial_(trivial),
68 bound_(bound),
69 varBound_(varBound)
70 { }
71
73 friend OGDF_EXPORT std::ostream &operator<<(std::ostream &out, const ConClass &rhs);
74
76 bool allVarBinary() const { return allVarBinary_; }
77
79 bool trivial() const { return trivial_; }
80
81
82private:
83
85
88
91
93 bool bound_;
94
97};
98
99}
100#pragma GCC visibility pop
Base class of all other classes of ABACUS.
Definition abacusroot.h:69
Constraint classification.
Definition conclass.h:45
bool allVarBinary_
true if all variables are binary.
Definition conclass.h:87
bool bound_
true if the constraint is a bound of the variable.
Definition conclass.h:93
bool varBound_
true if the constraint is a variable lower/upper bound.
Definition conclass.h:96
bool allVarBinary() const
Returns true if all variables with nonzero coefficients of the constraint are binary.
Definition conclass.h:76
friend std::ostream & operator<<(std::ostream &out, const ConClass &rhs)
Output operator for constraint classifications.
ConClass(const Master *master, bool discrete, bool allVarBinary, bool trivial, bool bound, bool varBound)
The constructor initializes the constraint classification with.
Definition conclass.h:57
bool trivial_
true if it is a bound or a variable lower/upper bound.
Definition conclass.h:90
bool trivial() const
Returns true if the constraint is a bound or a variable upper bound.
Definition conclass.h:79
The master of the optimization.
Definition master.h:70
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF dynamic library (shared object / DLL),...
Definition config.h:117
the master of the optimization.