blob: 6c61d3e27651c883fa8f9d04ff38ed950af4685b (
plain)
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
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
|
#include <fstream>
#include "aztec.hpp"
int main(int argc, char* argv[]) {
unsigned n = 100;
unsigned m = 100;
Real T = 1;
int opt;
while ((opt = getopt(argc, argv, "n:m:T:")) != -1) {
switch (opt) {
case 'n':
n = atoi(optarg);
break;
case 'm':
m = (unsigned)atof(optarg);
break;
case 'T':
T = atof(optarg);
break;
default:
exit(1);
}
}
Rng r;
AztecDiamond G(n);
#pragma omp declare reduction(vec_int_plus : std::vector<long int> : \
std::transform(omp_out.begin(), omp_out.end(), omp_in.begin(), omp_out.begin(), std::plus<long int>())) \
initializer(omp_priv = decltype(omp_orig)(omp_orig.size()))
std::string filename = "order_" + std::to_string(n) + "_" + std::to_string(T) + ".dat";
std::ifstream input(filename);
if (T == 0) {
std::vector<long int> data_x(G.vertices.size());
std::vector<long int> data_y(G.vertices.size());
if (input.is_open()) {
for (unsigned i = 0; i < G.vertices.size(); i++) {
input >> data_x[i];
input >> data_y[i];
}
input.close();
}
#pragma omp parallel for reduction(vec_int_plus : data_x) reduction(vec_int_plus : data_y)
for (unsigned i = 0; i < m; i++) {
G.setWeights(r);
PerfectMatching pm = findGroundState(G);
for (unsigned i = 0; i < G.vertices.size() / 2; i++) {
unsigned j = pm.GetMatch(i);
data_x[i] += G.vertices[i].coordinate[0];
data_y[i] += G.vertices[i].coordinate[1];
data_x[i] -= G.vertices[j].coordinate[0];
data_y[i] -= G.vertices[j].coordinate[1];
data_x[j] += G.vertices[i].coordinate[0];
data_y[j] += G.vertices[i].coordinate[1];
data_x[j] -= G.vertices[j].coordinate[0];
data_y[j] -= G.vertices[j].coordinate[1];
}
}
std::ofstream output(filename);
for (unsigned i = 0; i < G.vertices.size(); i++) {
output << data_x[i] << " " << data_y[i] << std::endl;
}
output.close();
} else {
std::vector<Real> data_x(G.vertices.size());
std::vector<Real> data_y(G.vertices.size());
if (input.is_open()) {
for (unsigned i = 0; i < G.vertices.size(); i++) {
input >> data_x[i];
input >> data_y[i];
}
input.close();
}
std::vector<Real> avgProbabilities(G.edges.size());
for (unsigned i = 0; i < m; i++) {
G.setWeights(r);
G.computeWeights(T);
G.computeProbabilities();
for (unsigned j = 0; j < G.edges.size(); j++) {
avgProbabilities[j] += G.edges[j].probability;
}
}
for (unsigned i = 0; i < G.edges.size(); i++) {
const AztecDiamond::Edge& e = G.edges[i];
const AztecDiamond::Vertex& vt = *e.tail;
const AztecDiamond::Vertex& vh = *e.head;
data_x[vt.index] += avgProbabilities[i] * (vt.coordinate[0] - vh.coordinate[0]);
data_y[vt.index] += avgProbabilities[i] * (vt.coordinate[1] - vh.coordinate[1]);
data_x[vh.index] += avgProbabilities[i] * (vt.coordinate[0] - vh.coordinate[0]);
data_y[vh.index] += avgProbabilities[i] * (vt.coordinate[1] - vh.coordinate[1]);
}
std::ofstream output(filename);
for (unsigned i = 0; i < G.vertices.size(); i++) {
output << data_x[i] << " " << data_y[i] << std::endl;
}
output.close();
}
return 0;
}
|
