-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathboostprop.cc
294 lines (259 loc) · 7.5 KB
/
boostprop.cc
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
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
/***************************************************************************
boostprop.h - description
-------------------
begin : Thu Feb 16 2006
copyright : (C) 2005 by Knut-Helge Vik
email : knuthelv@ifi.uio.no
***************************************************************************/
#include "boostprop.h"
#include "treealgs/treealgs.h"
#include <iostream>
#include <string.h>
using namespace std;
using namespace TreeAlgorithms;
/*-----------------------------------------------------------------------
VertexProp -
Boost graph vertex descriptor
------------------------------------------------------------------------- */
VertexProp::VertexProp() : id(-1), vertexState(NO_STATE), vertexFunction(NO_FUNCTION)
{
init();
}
VertexProp::VertexProp(int inid, double x, double y, VertexFunction function) : id(inid), xpos(x), ypos(y), vertexState(NO_STATE), vertexFunction(function)
{
asid = -1;
val = 0;
obj = NULL;
degree_limit = -1;
}
VertexProp::VertexProp(int inid, double x, double y, VertexState state, VertexFunction function) : id(inid), xpos(x), ypos(y), vertexState(state), vertexFunction(function)
{
asid = -1;
val = 0;
obj = NULL;
degree_limit = -1;
}
VertexProp::VertexProp(int inid, VertexFunction function) : id(inid), vertexState(NO_STATE), vertexFunction(function)
{
init();
}
VertexProp::VertexProp(int inid, VertexState state, VertexFunction function) : id(inid), vertexState(state), vertexFunction(function)
{
init();
}
VertexProp::VertexProp(const VertexProp& vp) : vertexState(vp.vertexState), vertexFunction(vp.vertexFunction)
{
initProp(vp);
}
VertexProp::VertexProp(const VertexProp& vp, VertexState state) : vertexState(state), vertexFunction(vp.vertexFunction)
{
initProp(vp);
}
VertexProp::VertexProp(const VertexProp& vp, VertexState state, VertexFunction function) : vertexState(state), vertexFunction(function)
{
initProp(vp);
}
/*-----------------------------------------------------------------------
init()
------------------------------------------------------------------------- */
void VertexProp::init()
{
xpos = 0;
ypos = 0;
asid = -1;
val = 0;
obj = NULL;
degree_limit = -1;
}
void VertexProp::initProp(const VertexProp& vp)
{
id = vp.id;
xpos = vp.xpos;
ypos = vp.ypos;
asid = vp.asid;
val = vp.val;
obj = vp.obj;
degree_limit = vp.degree_limit;
}
/*-----------------------------------------------------------------------
EdgeProp -
Boost graph edge descriptor
------------------------------------------------------------------------- */
EdgeProp::EdgeProp() : id(-1,-1), delay(0), weight(0), bw(0), cost(0), length(0), edgeState(BASIC), hops(0), obj(NULL)
{
}
EdgeProp::EdgeProp(const EdgeProp& ep) : id(ep.id)
{
init(ep);
}
EdgeProp::EdgeProp(const EdgeProp& ep, int src, int dest) : id(src, dest)
{
assert(id.first > -1 && id.second > -1);
init(ep);
}
EdgeProp::EdgeProp(const EdgeProp& ep, EdgeId eid) : id(eid)
{
assert(id.first > -1 && id.second > -1);
id = eid;
init(ep);
}
EdgeProp::EdgeProp(const EdgeProp& ep, EdgeState state)
{
init(ep);
edgeState = state;
}
EdgeProp::EdgeProp(const EdgeProp& ep, EdgeId eid, EdgeState state) : id(eid)
{
assert(id.first > -1 && id.second > -1);
init(ep);
id = eid;
edgeState = state;
}
EdgeProp::EdgeProp(EdgeId eid, double indelay, double inweight, double inbw, double incost, double inlength, int inhops) :
id(eid), delay(indelay), weight(inweight), bw(inbw), cost(incost), length(inlength), hops(inhops)
{
assert(id.first > -1 && id.second > -1);
assert(delay >= 0);
assert(weight >= 0);
assert(bw >= 0);
assert(cost >= 0);
assert(hops >= 0);
edgeState = BASIC;
}
/*-----------------------------------------------------------------------
init()
------------------------------------------------------------------------- */
void EdgeProp::init(const EdgeProp& ep)
{
delay = ep.delay;
weight = ep.weight;
bw = ep.bw;
cost = ep.cost;
length = ep.length;
hops = ep.hops;
obj = ep.obj;
edgeState = ep.edgeState;
assert(delay >= 0);
assert(weight >= 0);
assert(bw >= 0);
assert(cost >= 0);
assert(hops >= 0);
}
/*-----------------------------------------------------------------------
operator<< - VertexState
------------------------------------------------------------------------- */
const char *stringVertexState[] = { "error", "no_algo", "member", "steiner", "steiner-available" };
const char *printAlgo(VertexState vs)
{
return stringVertexState[vs];
}
VertexState getVertexState(char *vs)
{
for( int i = 0; i < END_VERTEX_STATE; i++)
if(strcmp(vs, stringVertexState[i]) == 0) return (VertexState) i;
return (VertexState) 0;
}
std::ostream& operator<<( std::ostream& ostr, const VertexState& msg )
{
switch( msg )
{
#define CASE(t) case t: ostr << #t; break;
CASE(VERTEX_STATE_ERROR)
CASE(NO_STATE)
CASE(GROUP_MEMBER)
CASE(STEINER_POINT)
CASE(STEINER_POINT_AVAILABLE)
#undef CASE
default:
cerr << "Missing operator<< case for VertexState " << (int) msg << endl;
assert(0);
break;
}
return ostr;
}
/*-----------------------------------------------------------------------
operator<< - VertexFunction
------------------------------------------------------------------------- */
const char *stringVertexFunction[] = { "error", "no_algo", "client", "proxy", "server", "wcn"};
const char *printAlgo(VertexFunction vf)
{
return stringVertexFunction[vf];
}
VertexFunction getVertexFunction(char *vf)
{
for( int i = 0; i < END_VERTEX_FUNCTION; i++)
if(strcmp(vf, stringVertexFunction[i]) == 0) return (VertexFunction) i;
return (VertexFunction) 0;
}
std::ostream& operator<<(std::ostream& ostr, const VertexFunction& vf)
{
switch(vf)
{
#define CASE(t) case t: ostr << #t; break;
CASE(VERTEX_FUNCTION_ERROR)
CASE(NO_FUNCTION)
CASE(CLIENT)
CASE(PROXY)
CASE(SERVER)
CASE(WELL_CONNECTED)
#undef CASE
default:
ostr << "Missing operator<< case for VertexFunction " << endl;
assert(0);
break;
}
return ostr;
}
std::ostream& operator<<(std::ostream& ostr, const VertexProp& vp)
{
ostr << "V: " << vp.id << "\t" << vp.vertexFunction << "\t" << vp.vertexState ;
if(vp.degree_limit > -1)
ostr << " dl: " << vp.degree_limit ;
return ostr;
}
/*-----------------------------------------------------------------------
operator<< - EdgeState
------------------------------------------------------------------------- */
const char *stringEdgeState[] = { "error", "no_algo", "basic", "branch", "rejected" };
const char *printAlgo(EdgeState vs)
{
return stringEdgeState[vs];
}
EdgeState getEdgeState(char *vs)
{
for( int i = 0; i < END_EDGE_STATE; i++)
if(strcmp(vs, stringEdgeState[i]) == 0) return (EdgeState) i;
return (EdgeState) 0;
}
std::ostream& operator<<( std::ostream& ostr, const EdgeState& msg )
{
switch( msg )
{
#define CASE(t) case t: ostr << #t; break;
CASE(EDGE_STATE_ERROR)
CASE(NO_EDGE_STATE)
CASE(BASIC)
CASE(BRANCH)
CASE(REJECTED)
#undef CASE
default:
cerr << "Missing operator<< case for EdgeState " << (int) msg << endl;
assert(0);
break;
}
return ostr;
}
std::ostream& operator<<(std::ostream& ostr, const EdgeProp& ep)
{
ostr << "E: (" << ep.id.first << "," << ep.id.second << ") w: " << ep.weight << " c: " << ep.cost ;
return ostr;
}
bool operator==(const EdgeId& e, const EdgeId& f)
{
if(e.first == f.first && e.second == f.second)
return true;
if(e.second == f.first && e.first == f.second)
return true;
//cerr << e << f << " are not equal " << endl;
return false;
}