-
Notifications
You must be signed in to change notification settings - Fork 0
/
gen_graph.cpp
141 lines (114 loc) · 3.41 KB
/
gen_graph.cpp
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
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
#include <iostream>
#include <vector>
#include <cstdlib>
#include <cstdio>
#include <iterator>
#include <string>
#include <fstream>
#include "match_original_queued.cpp"
using namespace std;
namespace graph_matching {
// Our very low-budget random number generator.
const int modulo = 1000000;
static unsigned long x=123456789, y=362436069, z=521288629;
inline unsigned long rand2(void) {
unsigned long t;
x ^= x << 16; x ^= x >> 5; x ^= x << 1;
t = x; x = y; y = z;
z = t ^ x ^ y; return z;
}
// Our low-budget random shuffler.
template <class RandomAccessIterator>
inline void rand_shuffle2(RandomAccessIterator first, RandomAccessIterator last) {
typename iterator_traits<RandomAccessIterator>::difference_type i, n;
n = (last-first);
for (i=n-1; i>0; --i) {
swap (first[i],first[rand2()%(i+1)]);
}
}
// Populates |graph| with a randomly generated graph. The adjacency lists are
// randomly permuted to avoid the worst-case behaviour of |match|.
void gen_graph(float p) {
srand(clock());
for (int i = 0; i < n; i++) {
graph[i].clear();
graph[i].reserve(p*(n+1));
}
for (int i=0; i<n; ++i) {
for (int j=0; j<i; ++j) {
// sketchy random number generator
if ((rand() % modulo) / double(modulo - 1) < p) {
graph[i].push_back(j);
graph[j].push_back(i);
}
}
}
for (int i = 0; i < n; i++) {
rand_shuffle2(graph[i].begin(), graph[i].end());
}
}
void print_graph() {
for (int i=0; i<n; ++i) {
for (int j=0; j<graph[i].size(); ++j)
cout << graph[i][j] << " ";
cout << endl;
}
}
void write_graph(string ext) {
ofstream file;
file.open(string("graph-").append(ext).c_str());
file << n << endl;
for (int i=0; i<n; ++i) {
for (int j=0; j<graph[i].size(); ++j) {
file << graph[i][j] << " ";
}
file << -1 << '\n';
}
file.close();
}
void read_graph(string name) {
fstream file;
file.open(name.c_str());
if (!file.is_open()) return;
int val = 0;
file >> n;
for (int i = 0; i < n; i++) {
graph[i].clear();
graph[i].reserve(0.5*(n+1));
}
for (int i=0; i<n; ++i) {
while (file >> val, val != -1) {
graph[i].push_back(val);
}
}
file.close();
}
} // graph_matching
// =================================================================================
// int main() {
// graph_matching::n = 10000;
// graph_matching::gen_graph(1);
// graph_matching::write_graph("1");
// memset(graph_matching::graph, 0, sizeof(graph_matching::graph));
// graph_matching::gen_graph(0.5);
// graph_matching::write_graph("0.5");
// memset(graph_matching::graph, 0, sizeof(graph_matching::graph));
// graph_matching::gen_graph(0.25);
// graph_matching::write_graph("0.25");
// memset(graph_matching::graph, 0, sizeof(graph_matching::graph));
// graph_matching::gen_graph(0.1);
// graph_matching::write_graph("0.1");
// memset(graph_matching::graph, 0, sizeof(graph_matching::graph));
// graph_matching::gen_graph(0.01);
// graph_matching::write_graph("0.01");
// memset(graph_matching::graph, 0, sizeof(graph_matching::graph));
// // This is about where we lose connectedness apparently
// graph_matching::gen_graph(0.001);
// graph_matching::write_graph("0.001");
// memset(graph_matching::graph, 0, sizeof(graph_matching::graph));
// graph_matching::gen_graph(0.0001);
// graph_matching::write_graph("0.0001");
// memset(graph_matching::graph, 0, sizeof(graph_matching::graph));
// graph_matching::gen_graph(0.00001);
// graph_matching::write_graph("0.00001");
// }