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
|
#include <wolff/graph.hpp>
graph_t::graph_t(D_t D, L_t L, lattice_t lat) {
switch (lat) {
case SQUARE_LATTICE: {
nv = pow(L, D);
ne = D * nv;
v_adj.resize(nv);
coordinate.resize(nv);
for (std::vector<v_t> v_adj_i : v_adj) {
v_adj_i.reserve(2 * D);
}
for (v_t i = 0; i < nv; i++) {
coordinate[i].resize(D);
for (D_t j = 0; j < D; j++) {
coordinate[i][j] = (i / (v_t)pow(L, D - j - 1)) % L;
v_adj[i].push_back(pow(L, j + 1) * (i / ((v_t)pow(L, j + 1))) + fmod(i + pow(L, j), pow(L, j + 1)));
v_adj[i].push_back(pow(L, j + 1) * (i / ((v_t)pow(L, j + 1))) + fmod(pow(L, j+1) + i - pow(L, j), pow(L, j + 1)));
}
}
break;
}
case DIAGONAL_LATTICE: {
nv = D * pow(L, D);
ne = D * nv;
v_adj.resize(nv);
coordinate.resize(nv);
for (std::vector<v_t> v_adj_i : v_adj) {
v_adj_i.reserve(4 * (D - 1));
}
for (D_t i = 0; i < D; i++) {
v_t sb = i * pow(L, D);
for (v_t j = 0; j < pow(L, D); j++) {
v_t vc = sb + j;
v_adj[vc].push_back(((i + 1) % D) * pow(L, D) + j);
v_adj[vc].push_back(((i + 1) % D) * pow(L, D) + pow(L, D - 1) * (j / (v_t)pow(L, D - 1)) + (j + 1 - 2 * (i % 2)) % L);
v_adj[vc].push_back(((i + 1) % D) * pow(L, D) + pow(L, D - 1) * ((L + (j/ (v_t)pow(L, D - 1)) - 1 + 2 * (i % 2)) % L) + (j - i) % L);
v_adj[vc].push_back(((i + 1) % D) * pow(L, D) + pow(L, D - 1) * ((L + (j/ (v_t)pow(L, D - 1)) - 1 + 2 * (i % 2)) % L) + (j + 1 - i) % L);
}
}
break;
}
}
}
void graph_t::add_ext() {
for (std::vector<v_t>& v_adj_i : v_adj) {
v_adj_i.push_back(nv);
}
v_adj.resize(nv + 1);
coordinate.resize(nv + 1);
v_adj[nv].reserve(nv);
for (v_t i = 0; i < nv; i++) {
v_adj[nv].push_back(i);
}
coordinate[nv].resize(coordinate[0].size());
ne += nv;
nv += 1;
}
|
