-
Notifications
You must be signed in to change notification settings - Fork 0
/
vPrimeToUse.cpp
228 lines (190 loc) · 6.2 KB
/
vPrimeToUse.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
/*
* BetaCome: betacome of future network routing
*
* Code to accompany the competition:
* huawei software challenge : future network routing,
* Yuanyuan Qin, Song Tang,2016
*
* Copyright (C) 2016 Yuanyuan Qin, Peking University, Shenzhen, China
*
* This file is part of BetaCome.
*
* BetaCome is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* BetaCome 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with BetaCome. If not, see <http://www.gnu.org/licenses/>.
*
*/
#include "vPrimeToUse.h"
#include "assist.h"
#include <stdlib.h>
//copy valid vprime points to vprimetouse
int VPrimeToUse::refreshVPrime(GraphBase &graph, Path &path)
{
//if size is empty, return exit_success
if (path.getVPrimeSize() == 0) return EXIT_SUCCESS;
Point xx;
vPrime2Use.resize(path.getVPrimeSize(), xx);
//copy v' point to vPrime2Use
list<Point>::iterator pIter = vPrime2Use.begin();
*pIter = graph.getNode(path.getVPrime(0));//copy V¡¯Point
topoOrderMax = (*pIter).getTopoOrder();//initialize
topoOrderMin = (*pIter).getTopoOrder();//this is important,or will get wrong
for (int i = 0; pIter != vPrime2Use.end(); ++pIter, ++i)
{
//must check, vprime points may be setted POINT_DELETE
if (path.getValidity(path.getVPrime(i)) == POINT_VALID)
{
*pIter = graph.getNode(path.getVPrime(i));//copy V¡¯Point
//get max and min of topo order
topoOrderMax = assistMax(topoOrderMax, (*pIter).getTopoOrder());
topoOrderMin = assistMin(topoOrderMin, (*pIter).getTopoOrder());
}
}
return EXIT_SUCCESS;
}
VPrimeToUse::VPrimeToUse(GraphBase &graph, Path &path) :topoOrderMax(0), topoOrderMin(0)
{
refreshVPrime(graph, path);
}
int VPrimeToUse::refreshAgainVPrime(GraphBase &graph, Path &path)
{
refreshVPrime(graph, path);
randomOrder();
return EXIT_SUCCESS;
}
//return the iter after last vprime of current scc num
//such as 6(3) 7(3) 5(2) 4(1) 2(0) in vprime2use,we should return iter of 5, not iter of 7
//when no vprime satisfied, return vprim2use.end()
list<Point>::iterator VPrimeToUse::curSccEnd(GraphBase &graph, Path &path)
{
int curSccNum = 0;
int oneTimeFlag = false;
for (auto iterTemp = vPrime2Use.begin(); iterTemp != vPrime2Use.end(); ++iterTemp)
{
int pointId = (*iterTemp).getPointId();
Point &pointTemp = graph.getNode(pointId);
if ((path.getUsed(pointId) == false) && (oneTimeFlag == false))
{
curSccNum = pointTemp.getSccNum();
oneTimeFlag = true;
}
if ((oneTimeFlag == true) && (curSccNum != pointTemp.getSccNum()))
{
return iterTemp;
}
}
//if all vprime are invalid, or all vprime are the same scc,return end
return vPrime2Use.end();
}
list<Point>::iterator VPrimeToUse::insertVPrime(GraphBase &graph, Path &path, int vPrimeId)
{
Point &pointTemp = graph.getNode(vPrimeId);
path.setUsed(vPrimeId, false);
for (auto iterTemp = vPrime2Use.begin(); iterTemp != vPrime2Use.end(); ++iterTemp)
{
if (pointTemp.getSccNum() >= (*iterTemp).getSccNum())
{
return vPrime2Use.insert(iterTemp, pointTemp);
}
}
return vPrime2Use.insert(vPrime2Use.end(), pointTemp);
}
list<Point>::iterator VPrimeToUse::deleteVPrime(list<Point>::iterator iter)
{
return vPrime2Use.erase(iter);
}
void VPrimeToUse::sortVPrime()//sort vprimevector
{
//stable_sort(vPrime2Use.begin(), vPrime2Use.end());
vPrime2Use.sort();
//sort(vPrime2Use.begin(), vPrime2Use.end());
}
int VPrimeToUse::deleteUsedVPrime(GraphBase &graph, Path &path)
{
list<Point>::iterator iterBefore;
for (auto iterTemp = vPrime2Use.begin(); iterTemp != vPrime2Use.end(); )
{
if (path.getUsed((*iterTemp).getPointId()) == true)
{
//if we erase, this iter will be invalid
iterBefore = iterTemp;
++iterTemp;
vPrime2Use.erase(iterBefore);
}
else
{
++iterTemp;
}
}
return EXIT_SUCCESS;
}
void VPrimeToUse::printVprime()
{
for (auto iter = vPrime2Use.begin(); iter != vPrime2Use.end(); ++iter)
{
cout << (*iter).getPointId() << " " << "topoOrder:" << (*iter).getTopoOrder()
<< " " << "inoutdegree:" << (*iter).getInoutDegree() << endl;
}
}
//random the order of vprime belong to the same scc
int VPrimeToUse::randomOrder()
{
auto iterVPrime = vPrime2Use.begin();
int startIndex = 0;
int endIndex = 0;
int curSccNum = 0;
static unsigned int seedCnt = 0;
curSccNum = (*iterVPrime).getSccNum();
for (; iterVPrime != vPrime2Use.end(); ++iterVPrime)
{
if (curSccNum != (*iterVPrime).getSccNum())
{
//update cursccnum
curSccNum = (*iterVPrime).getSccNum();
//if more than 3 node in one scc
if ((endIndex - startIndex) >= 3)
{
//exchange from startIndex to endIndex-1,[startIndex,endIndex)
for (int i = 0; i < (endIndex - startIndex); i++)
{
srand((unsigned int)(seedCnt));
int ii = (rand()) % (endIndex - startIndex) + startIndex;//[startIndex,endIndex)
srand((unsigned int)(seedCnt + 1000));
int jj = (rand()) % (endIndex - startIndex) + startIndex;//[startIndex,endIndex)
exchange(ii, jj);
seedCnt++;//add seed
//cout << "ii: " << ii << " jj: " << jj << endl;
}
}
//uapdate index
startIndex = endIndex;
}
endIndex++;
}
//for the rest
//if more than 3 node in one scc
if ((endIndex - startIndex) >= 3)
{
//exchange from startIndex to endIndex-1,[startIndex,endIndex)
for (int i = 0; i < (endIndex - startIndex); i++)
{
srand((unsigned int)(seedCnt));
int ii = (rand()) % (endIndex - startIndex) + startIndex;//[startIndex,endIndex)
srand((unsigned int)(seedCnt + 1000));
int jj = (rand()) % (endIndex - startIndex) + startIndex;//[startIndex,endIndex)
exchange(ii, jj);
seedCnt++;//add seed
//cout << "ii: " << ii << " jj: " << jj << endl;
}
}
return EXIT_SUCCESS;
}