-
Notifications
You must be signed in to change notification settings - Fork 0
/
related_codes.cpp
221 lines (184 loc) · 5.75 KB
/
related_codes.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
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
#include <iostream>
#include <fstream>
#include <string>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
int each_vertex_200_times(int i)
{
if (i<2000)
return 6;
else if (i < 4000)
return 7;
else if (i < 6000)
return 8;
else if (i < 8000)
return 9;
else
return 10;
}
void generate_black_box()
{
srand(time(NULL));
for (int i_10000 = 0; i_10000 < 10000; i_10000++)
{
int vertex = each_vertex_200_times(i_10000);
int edge = 10;
int edge_counter = 0;
vector<vector<int>> mat(vertex, vector<int> (vertex));
vector<vector<int>> mat2(vertex, vector<int> (vertex));
while (edge != edge_counter)
{
// generate 2 vertices
int random_v1 = rand() % vertex;
int random_v2 = rand() % vertex;
// put an edge between them
if(mat[random_v1][random_v2] == 0 && random_v1 != random_v2)
{
mat[random_v1][random_v2] = 1;
mat[random_v2][random_v1] = 1;
mat2[random_v1][random_v2] = 1;
mat2[random_v2][random_v1] = 1;
edge_counter++;
}
}
ofstream out;
string out_file = "/Users/muzeyyenalkap/Downloads/outputs2/" + to_string(i_10000) + "sample.txt";
out.open(out_file);
out << vertex << " " << (edge*2) << endl;
for (int row =0; row<vertex; row++) {
for (int col=0; col<vertex; col++) {
if (mat[row][col] == 1 && row != col)
{
out << (to_string(row+1) + " " + to_string(col+1))<< endl;
}
}
}
out.close();
ofstream out2;
string out_file2 = "/Users/muzeyyenalkap/Downloads/outputs2/"+ to_string(i_10000) + "sample_exact.txt";
out2.open(out_file2);
//out2 << vertex << "\t" << (edge) << endl;
out2 << vertex;
for (int u=1; u<vertex+1; u++) {
out2 << " "<< u;
}
out2<< endl;
for (int row =0; row<vertex; row++) {
out2 << (row+1) ;
for (int col=0; col<vertex; col++) {
out2 << " " << mat2[row][col];
}
out2 << endl;
}
out2.close();
}
}
void convert_inputs()
{
// sample inputlardan bizim formata dönüştür
int iii = 9;
int vertex = 150;
int edge = 250;
vector<vector<int>> mat(vertex, vector<int> (vertex));
ifstream in;
string file_name ="/Users/muzeyyenalkap/Downloads/ProblemInstances/T1/V150E250/9/Test/Problem.dat_150_250_9";
in.open(file_name.c_str());
int edge_counter = 305;
string line;
while ( edge_counter != 0)
{
getline(in,line);
edge_counter--;
}
ofstream out;
string out_file = "/Users/muzeyyenalkap/Downloads/outputs_v150_e250/" + to_string(iii) + "sample.txt";
out.open(out_file);
out << vertex << " " << (edge*2) << endl;
int col=1, row=1;
while ( getline(in,line))
{
for (int l=0; l<line.length(); l+=2)
{
if (line[l] == '1' && row != col)
{
out << (to_string(row) + " " + to_string(col))<< endl;
}
col ++;
}
row++;
col = 1;
}
out.close();
}
void compare_exact_and_heuristic()
{
ifstream in_exact, in_heu;
string exact_name = "/Users/muzeyyenalkap/Downloads/cs301_project/exact_results.txt";
string heu_name = "/Users/muzeyyenalkap/Downloads/cs301_project/greedy_results.txt";
in_exact.open(exact_name.c_str());
in_heu.open(heu_name.c_str());
double result_vert = 0;
double result_time = 0;
double w_e, w_h;
vector<double> quality;
vector<double> time;
double ratio_vertex = 0, ratio_time = 0, mean_vert, mean_time;
for (int y=0; y<5; y++) {
for (int i=0; i<2000; i++)
{
in_exact >> w_e;
in_heu >> w_h;
ratio_vertex = w_e / w_h;
result_vert += ratio_vertex;
in_exact >> w_e;
in_heu >> w_h;
ratio_time = w_e / w_h;
result_time += ratio_time;
}
mean_vert = result_vert / 2000;
mean_time = result_time / 2000;
quality.push_back(mean_vert);
time.push_back(mean_time);
result_vert = 0;
result_time = 0;
}
ofstream out;
string output_name = "/Users/muzeyyenalkap/Downloads/cs301_project/comparison_results.txt";
out.open(output_name.c_str());
for (int v=0; v < quality.size(); v++)
{
out << "Number of vertices = " << (v+6) << endl;
out << quality[v] << " " << time[v] << endl;
}
}
void find_fails()
{
ifstream in_exact, in_heu;
string exact_name = "/Users/muzeyyenalkap/Downloads/cs301_project/exact_results.txt";
string heu_name = "/Users/muzeyyenalkap/Downloads/cs301_project/greedy_results.txt";
in_exact.open(exact_name.c_str());
in_heu.open(heu_name.c_str());
double w_e, w_h;
vector<double> quality;
vector<double> time;
double ratio_vertex = 0, ratio_time = 0, mean_vert, mean_time;
for (int y=0; y<5; y++) {
for (int i=0; i<2000; i++)
{
in_exact >> w_e;
in_heu >> w_h;
if (w_e != w_h) {
cout << (y*2000) + i << " " <<w_e << " " << w_h << endl;
}
in_exact >> w_e;
in_heu >> w_h;
}
}
}
int main()
{
find_fails();
return 0;
}