-
Notifications
You must be signed in to change notification settings - Fork 10
/
tspm.hpp
76 lines (62 loc) · 1.77 KB
/
tspm.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
/*
* Copyright 2017-2018 Tom van Dijk, Johannes Kepler University Linz
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#ifndef TSPM_HPP
#define TSPM_HPP
#include <queue>
#include "solver.hpp"
namespace pg {
class TSPMSolver : public Solver
{
public:
TSPMSolver(Oink *oink, Game *game);
virtual ~TSPMSolver();
virtual void run();
int64_t lift_attempt = 0;
int64_t lift_count = 0;
protected:
int *pms;
int *tmp, *best;
int *strategy;
int *counts;
int64_t k;
std::deque<int> todo;
int *dirty;
int *unstable;
bool canlift(int node, int pl);
bool lift(int node, int target);
bool pm_less(int *a, int *b, int d, int pl);
void pm_copy(int *dst, int *src, int pl);
void pm_stream(std::ostream &out, int *pm);
void Prog(int *dst, int *src, int d, int pl);
void update(int pl);
void todo_push(int node) {
if (dirty[node]) return;
todo.push_back(node);
dirty[node] = 1;
#ifndef NDEBUG
if (trace >= 2) logger << "push(" << node << ")" << std::endl;
#endif
}
int todo_pop() {
int node = todo.front();
todo.pop_front();
dirty[node] = 0;
if (trace >= 2) logger << "pop() => " << node << std::endl;
return node;
}
};
}
#endif