Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
history.h
Go to the documentation of this file.
1
30#pragma once
31
33
34namespace abacus {
35
36
38
44public:
45
47
52 History(Master *master) :
53 master_(master),
54 primalBound_(100),
55 dualBound_(100),
56 time_(100),
57 n_(0)
58 { }
59
60 virtual ~History() { }
61
63
69 friend OGDF_EXPORT std::ostream& operator<<(std::ostream& out, const History &rhs);
70
72
81 void update();
82
83private:
84
86 int size() const { return primalBound_.size(); }
87
89 void realloc();
90
91
94
97
100
103
105 int n_;
106};
107
108}
Base class of all other classes of ABACUS.
Definition abacusroot.h:68
Solution histories.
Definition history.h:43
Array< double > dualBound_
The array storing the value of the best dual solution.
Definition history.h:99
Array< int64_t > time_
The CPU time in seconds, when the entry in the table was made.
Definition history.h:102
Array< double > primalBound_
The array storing the value of the best primal solution.
Definition history.h:96
Master * master_
A pointer to corresponding master of the optimization.
Definition history.h:93
void update()
Adds an additional line to the history table.
virtual ~History()
Definition history.h:60
void realloc()
The function realloc() enlarges the history table by 100 components.
History(Master *master)
Creates a history table with 100 possible entries.
Definition history.h:52
int n_
The number of entries in the history table.
Definition history.h:105
friend std::ostream & operator<<(std::ostream &out, const History &rhs)
The output operator.
int size() const
Returns the length of the history table.
Definition history.h:86
The master of the optimization.
Definition master.h:69
The parameterized class Array implements dynamic arrays of type E.
Definition Array.h:214
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Definition config.h:101
the master of the optimization.