-
Notifications
You must be signed in to change notification settings - Fork 0
/
generatoreGrafi.cpp
264 lines (227 loc) · 8.72 KB
/
generatoreGrafi.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
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
/******************************************************************************\
*
* File: generatoreGrafi.cpp
* Creation date: September 27, 2008
* Author: Alessio Sclocco
*
* License: See the end of this file for license information
*
\******************************************************************************/
#include <arcoTipo.h>
#include <algoritmi/cammini_minimi.h>
#include <grafo/GrafoNonOrientatoBetaMetrico_ListaArchi.h>
#include <tsp/TSPInstance.h>
#include <tsp/TSPWriter.h>
#include <ArgumentList.h>
#include <Space.h>
#include <Point.h>
#include <iostream>
#include <sstream>
#include <string>
#include <ctime>
#include <cmath>
#include <map>
using namespace asd;
using sclocco::ArgumentList;
using std::cout;
using std::cin;
using std::cerr;
using std::endl;
using std::string;
using std::istringstream;
using std::map;
using std::pair;
int main(int argc, char *argv[]) {
unsigned int n = 0;
double beta = 0.0;
bool verbose = false, correggi = false, shortest = false, l1 = false, l2 = false, linf = false, endpoint = false, interval = false;
w_type maxPeso = 100000;
string outfile = "";
istringstream converter;
GrafoNonOrientatoBetaMetrico_ListaArchi< w_type > grafo;
TSPInstance< w_type > problema;
TSPWriter< w_type > *writer;
ArgumentList args = ArgumentList(argc, argv);
if ( argc < 7 || argc > 9 ) {
cerr << "Utilizzo: " << args.getFirst() << " [-c] [-v] [-s|-e|-l1|-l2|-li] -n <nodi> -b <beta> <outfile>" << endl;
cerr << "\t-c\t : correggi se non beta metrico;" << endl;
cerr << "\t-i\t : metrica intervallo (base, base*2beta);" << endl;
cerr << "\t-s\t : metrica shortest path;" << endl;
cerr << "\t-e\t : metrica endpoint;" << endl;
cerr << "\t-l1\t : metrica spazio l1;" << endl;
cerr << "\t-l2\t : metrica spazio l2;" << endl;
cerr << "\t-li\t : metrica spazio linf;" << endl;
cerr << "\t-v\t : verboso." << endl << endl;
return -1;
}
else {
cout << args.getFirst() << endl;
}
verbose = args.getSwitch("-v");
correggi = args.getSwitch("-c");
shortest = args.getSwitch("-s");
interval = args.getSwitch("-i");
endpoint = args.getSwitch("-e");
l1 = args.getSwitch("-l1");
l2 = args.getSwitch("-l2");
linf = args.getSwitch("-li");
converter.str(args.getSwitchArgument("-n"));
converter >> n;
converter.clear();
converter.str(args.getSwitchArgument("-b"));
converter >> beta;
if ( n < 2 || beta < 0.5 ) {
cerr << "Il numero di nodi del grafo dev'essere maggiore di 2 ed il valore di beta >= 0.5" << endl;
return -1;
}
outfile = args.getFirst();
grafo.clear();
problema.clear();
grafo.setBeta(beta);
srand(time(NULL));
if ( interval ) {
/* Metrica intervall (base, base*2beta) */
grafo.generaRandom(n);
}
else if ( shortest ) {
/* Metrica shortest path */
for ( unsigned int i(0); i < n; i++ ) {
vertice *temp = grafo.aggiungiVertice();
temp->setKey(i);
}
for ( Grafo< w_type >::vertice_iterator x = grafo.lista_vertici.begin(); x != --(grafo.lista_vertici.end()); x++ ) {
Grafo< w_type >::vertice_iterator temp = x;
for ( Grafo< w_type >::vertice_iterator y = ++temp; y != grafo.lista_vertici.end(); y++ ) {
grafo.aggiungiArco(*x, *y, static_cast< w_type >(1.0 + (maxPeso * (rand() / (RAND_MAX + 1.0)))));
}
}
map< pair<vertice*, vertice*>, w_type > distanze = FloydWarshall(grafo);
for ( Grafo< w_type >::vertice_iterator x = grafo.lista_vertici.begin(); x != --(grafo.lista_vertici.end()); x++ ) {
Grafo< w_type >::vertice_iterator temp = x;
for ( Grafo< w_type >::vertice_iterator y = ++temp; y != grafo.lista_vertici.end(); y++ ) {
if ( distanze[pair<vertice*, vertice*>(*x, *y)] < grafo.getPesoArcoCompreso(*x, *y) ) {
(grafo.getArcoCompreso(*x, *y))->costo = distanze[pair<vertice*, vertice*>(*x, *y)];
}
}
}
}
else if ( endpoint ) {
/* Metrica endpoint */
double beta = grafo.getBeta();
double betaC = (pow(beta, 2.0) - pow(1 - beta, 2.0)) / (beta * (1 - beta));
double betaN = (1 - beta) / beta;
double betaNx = beta / (1 - beta);
arco< w_type > *tempArco = 0, *minArco = 0, *maxArco = 0;
for ( unsigned int i(0); i < n; i++ ) {
vertice *temp = grafo.aggiungiVertice();
temp->setKey(i);
}
for ( Grafo< w_type >::vertice_iterator x = grafo.lista_vertici.begin(); x != --(grafo.lista_vertici.end()); x++ ) {
bool first = true;
Grafo< w_type >::vertice_iterator temp = x;
for ( Grafo< w_type >::vertice_iterator y = ++temp; y != grafo.lista_vertici.end(); y++ ) {
double Bmin = (2 * pow(beta, 2.0)) / (1 - beta);
double Bmax = (1 - beta) / (2 * pow(beta, 2.0));
if ( y == ++(grafo.lista_vertici.begin()) && x == grafo.lista_vertici.begin() ) {
tempArco = grafo.aggiungiArco(*x, *y, static_cast< w_type >(1.0 + (maxPeso * (rand() / (RAND_MAX + 1.0)))));
minArco = tempArco;
maxArco = tempArco;
}
else {
tempArco = grafo.aggiungiArco(*x, *y, static_cast< w_type >(1.0 + (maxPeso * (rand() / (RAND_MAX + 1.0)))));
tempArco->costo = static_cast< w_type >((tempArco->costo * betaC) + betaN);
if ( first ) {
Grafo< w_type >::vertice_iterator tempVertice = x;
tempArco->costo *= grafo.getPesoArcoCompreso(*(--tempVertice), *x);
first = false;
}
else {
Grafo< w_type >::vertice_iterator tempVertice = y;
tempArco->costo *= grafo.getPesoArcoCompreso(*x, *(--tempVertice));
}
if ( grafo.sonoArchiAdiacenti(tempArco, minArco) ) {
Bmin = betaNx;
}
if ( grafo.sonoArchiAdiacenti(tempArco, maxArco) ) {
Bmax = betaN;
}
if ( tempArco->costo > (Bmin * minArco->costo) || tempArco->costo < (Bmax * maxArco->costo) ) {
tempArco->costo = static_cast< w_type >(floor((Bmax * maxArco->costo) + (((Bmin * minArco->costo) - (Bmax * maxArco->costo)) * (rand() / (RAND_MAX + 1.0)))));
}
if ( tempArco-> costo > maxArco->costo ) {
maxArco = tempArco;
}
if ( tempArco->costo < minArco->costo ) {
minArco = tempArco;
}
}
}
}
}
else {
Space< w_type > spazio;
map< vertice *, Point * > verticeToPoint;
for ( unsigned int i(0); i < n; i++ ) {
vertice *temp = grafo.aggiungiVertice();
temp->setKey(i);
verticeToPoint[temp] = spazio.addPoint(static_cast< w_type >(1.0 + (maxPeso * (rand() / (RAND_MAX + 1.0)))), static_cast< w_type >(1.0 + (maxPeso * (rand() / (RAND_MAX + 1.0)))));
}
for ( Grafo< w_type >::vertice_iterator v = grafo.lista_vertici.begin(); v != --(grafo.lista_vertici.end()); v++ ) {
Grafo< w_type >::vertice_iterator temp = v;
for ( Grafo< w_type >::vertice_iterator u = ++temp; u != grafo.lista_vertici.end(); u++ ) {
if ( l1 ) {
/* Metrica spazio l1 */
grafo.aggiungiArco(*v, *u, static_cast< w_type >(spazio.l1Distance(verticeToPoint[*v], verticeToPoint[*u])));
}
else if ( l2 ) {
/* Metrica spazio l2 */
grafo.aggiungiArco(*v, *u, static_cast< w_type >(spazio.l2Distance(verticeToPoint[*v], verticeToPoint[*u])));
}
else if ( linf ) {
/* Metrica spazio linf */
grafo.aggiungiArco(*v, *u, static_cast< w_type >(spazio.lInfDistance(verticeToPoint[*v], verticeToPoint[*u])));
}
}
}
}
if ( verbose ) {
cout << "Grafo generato con n = " << grafo.numVertici() << " ed m = " << grafo.numArchi() << endl;
}
if ( correggi ) {
while ( !grafo.verifyBetaMetric(correggi) ) {};
if ( verbose ) {
cout << "Il grafo è risultato " << grafo.getBeta() << "-metrico." << endl;
}
}
problema.setProblemType("TSP");
problema.setEdgeWType("EXPLICIT");
problema.setEdgeWFormat("UPPER_ROW");
problema.setGrafo(&grafo);
writer = new TSPWriter< w_type >(&problema);
writer->setOutputFile(outfile);
if ( !writer->write() ) {
cerr << "Si e' verificato un problema durante il salvataggio dell'istanza su file." << endl;
delete writer;
return 1;
}
delete writer;
if ( verbose ) {
cout << "L'istanza e' stata salvata in " << outfile << endl;
}
return 0;
}
/******************************************************************************\
* Copyright (C) 2008 Alessio Sclocco <alessio@sclocco.eu>
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 3 of the License, or (at your option) any later version.
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
\******************************************************************************/