-
Notifications
You must be signed in to change notification settings - Fork 0
/
betaOptimize.cpp
5048 lines (4033 loc) · 172 KB
/
betaOptimize.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
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
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* 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 "betaOptimize.h"
#include "lib_time.h"
#include <memory.h>
#include <unordered_set>
#include <unordered_map>
#include <cassert>
using namespace std;
BetaOptimize::BetaOptimize() :nodeFilter(INT_MAX), pieceOrNodeFilter(INT_MAX), dfsFlag(0), convergenceTimes(0),
switchAlgorithmKind(SWITCHNODEPIECE)
{
}
inline int BetaOptimize::switchAlgorithm(GraphVector &graph, Path &path, int curMaxNodeId, list<PathPiece>::iterator iterOldPiece45, int secMaxNode)
{
if (switchAlgorithmKind == SWITCHNODEPIECE)
{
return (switchNodePiece(graph, path, curMaxNodeId, iterOldPiece45));
}
else if (switchAlgorithmKind == SWITCHNODENODE)
{
return (switchNodeNode(graph, path, curMaxNodeId, secMaxNode));
}
}
//optimize path
int BetaOptimize::optimizePath(GraphVector &graph, GraphVector &graphReverse, Path &path1, Path &path2, PathEdge &path1Edge, PathEdge &path2Edge)
{
//three opt to optmize
threeOptSlow(graph, path1, path2, path1Edge, path2Edge);
//three opt to optmize
threeOptFast(graph, graphReverse, path1, path2, path1Edge, path2Edge);
//four opt to optmize
fourOptSlow(graph, path1, path2, path1Edge, path2Edge);
//four opt to optmize
//fourOptFast(graph, graphReverse, path1, path2, path1Edge, path2Edge);
//four opt to optmize
fiveOptSlow(graph, path1, path2, path1Edge, path2Edge);
//four opt to optmize
//fiveOptFast(graph, graphReverse, path1, path2, path1Edge, path2Edge);
return EXIT_SUCCESS;
}
//here we have 4 nodes and 3 pieces named
//path as follows:
//old path: node1 iterOldPiece12 node2 iterOldPiece23 node3 node4 iterOldPiece45 node5
//new path: node1 iterNewPiece13 node3 node4 iterNewPiece42 node2 iterNewPiece25 node5
int BetaOptimize::threeOptSlow(GraphVector &graph, Path &path1, Path &path2, PathEdge &path1Edge, PathEdge &path2Edge)
{
if (graph.getNodeNum() >= THREE_OPTBOUNDARIES) return EXIT_SUCCESS;
//enum for flag
enum enumFlag
{
PATH1NOTCHANGE = 2,
PATH1CHANGE = 3,
PATH2NOTCHANGE = 4,
PATH2CHANGE = 5
};
//for search path,save in pi[]
int pi13[MAXPOINTNUM];
int pi42[MAXPOINTNUM];
int pi25[MAXPOINTNUM];
//common color in search path
int commonColor[MAXPOINTNUM + 1];
//times: sum of while(loopPath1) and while(loopPath2)
int loopCnt = 0;
//************************for path1**********************
//pathlist for path
list<PathPiece>& pathListPath1 = path1.getPathList();
//for flag
int loopFlagPath1 = true;
int changeFlagPath1 = PATH1NOTCHANGE;
//for new path
list<PathPiece>::iterator iterNewPiece13Path1;
list<PathPiece>::iterator iterNewPiece42Path1;
list<PathPiece>::iterator iterNewPiece25Path1;
int weightNewPath1 = 0;
//for old path
list<PathPiece>::iterator iterOldPiece12Path1 = pathListPath1.begin();
list<PathPiece>::iterator iterOldPiece23Path1 = (++(pathListPath1.begin()));
list<PathPiece>::iterator iterOldPiece45Path1;
int weightOldPath1;
//node id num
int loopEndNodeIdPath1 = (*(--(pathListPath1.end()))).getFirstNode();//initial to be the last vprime point in path
//old node id
int node1Path1 = (*iterOldPiece12Path1).getFirstNode();
int node2Path1 = (*iterOldPiece12Path1).getLastNode();
int node3Path1 = (*iterOldPiece23Path1).getLastNode();
int node4Path1;
int node5Path1;
//save points that have been searched
unordered_set<string> searchedRecordPath1;
//************************for path2**********************
//pathlist for path
list<PathPiece>& pathListPath2 = path2.getPathList();
//for flag
int loopFlagPath2 = true;
int changeFlagPath2 = PATH2NOTCHANGE;
//for new path
list<PathPiece>::iterator iterNewPiece13Path2;
list<PathPiece>::iterator iterNewPiece42Path2;
list<PathPiece>::iterator iterNewPiece25Path2;
int weightNewPath2 = 0;
//for old path
list<PathPiece>::iterator iterOldPiece12Path2 = pathListPath2.begin();
list<PathPiece>::iterator iterOldPiece23Path2 = (++(pathListPath2.begin()));
list<PathPiece>::iterator iterOldPiece45Path2;
int weightOldPath2;
//node id num
int loopEndNodeIdPath2 = (*(--(pathListPath2.end()))).getFirstNode();//initial to be the last vprime point in path
//old node id
int node1Path2 = (*iterOldPiece12Path2).getFirstNode();
int node2Path2 = (*iterOldPiece12Path2).getLastNode();
int node3Path2 = (*iterOldPiece23Path2).getLastNode();
int node4Path2;
int node5Path2;
//save points that have been searched
unordered_set<string> searchedRecordPath2;
while (true)
{
//************************for path1**********************
//reset change flag
changeFlagPath1 = PATH1NOTCHANGE;
loopCnt++;
while (loopFlagPath1)//time complexity:O(100 * 100)
{
#ifdef TIMELIMIT
if ((getTime() - timeMeasure.startTime)>TIMELIMITNUM)
{
cout << "3optSlow1 end for time out......" << (getTime() - timeMeasure.startTime) << endl;
break;
}
#endif
//compute the weight decrease of iterOldPiece12 and iterOldPiece23
int node2WeightOldPath1 = computeVPrimeNodeWeight(graph, path1, node2Path1, path2Edge);
//set used property false of old piece, for search path
path1.setPieceNodeFalse(graph, iterOldPiece12Path1);
path1.setPieceNodeFalse(graph, iterOldPiece23Path1);
//string: node1 node2 node3
string searchedNodes123StringPath1 = to_string(node1Path1) + to_string(node2Path1) + to_string(node3Path1);
for (iterOldPiece45Path1 = pathListPath1.begin(); iterOldPiece45Path1 != pathListPath1.end(); ++iterOldPiece45Path1)
{
//get node4 and node5
node4Path1 = (*iterOldPiece45Path1).getFirstNode();
node5Path1 = (*iterOldPiece45Path1).getLastNode();
//check whether have been searched before
string searchedNodesStringPath1 = searchedNodes123StringPath1 + to_string(node4Path1) + to_string(node5Path1);
static int searchedCntPath1 = 0;
if (searchedRecordPath1.count(searchedNodesStringPath1) >= 1)
{
searchedCntPath1++;
//cout << "searchedCntPath1:" << searchedCntPath1 << endl;
continue;
}
else searchedRecordPath1.insert(searchedNodesStringPath1);
//don't get into to the range of sccNum,continue
if (graph.getNode(node5Path1).getSccNum() > graph.getNode(node2Path1).getSccNum()) continue;
//exceeded the range of sccNum,break, should go to next node
if (graph.getNode(node2Path1).getSccNum() > graph.getNode(node4Path1).getSccNum())
{
iterOldPiece45Path1 = pathListPath1.end();
break;
}
//if node2 == node4 or node5, pass
if ((node2Path1 == node4Path1) || (node2Path1 == node5Path1)) continue;
//old weight sum of piece 12 23 45
weightOldPath1 = node2WeightOldPath1 + computePathPieceWeight(graph, path1, iterOldPiece45Path1, path2Edge);
//set used property false of oldpiece, for search path
path1.setPieceNodeFalse(graph, iterOldPiece45Path1);
memset(commonColor, 0, sizeof(int)*(MAXPOINTNUM + 1));
#ifdef SEARCHPATHDIJKSTRA
//when we use MultiPathPieceDijkstra, we must initial commoncolor first
weightNewPath1 = searchMultiPathPieceDijkstra(graph, path1, path2Edge, node1Path1, node3Path1, commonColor, pi13, false);
if (weightNewPath1 < weightOldPath1)
{
setCommonColor(node1Path1, node3Path1, pi13, commonColor);//if we can not find a pathpiece,this set func will get wrong
weightNewPath1 += searchMultiPathPieceDijkstra(graph, path1, path2Edge, node4Path1, node2Path1, commonColor, pi42, false);
if (weightNewPath1 < weightOldPath1)
{
setCommonColor(node4Path1, node2Path1, pi42, commonColor);
weightNewPath1 += searchMultiPathPieceDijkstra(graph, path1, path2Edge, node2Path1, node5Path1, commonColor, pi25, false);
}
}
#endif//SEARCHPATHDIJKSTRA
//if weight do not reduce,restore used property of points
if ((weightNewPath1 >= weightOldPath1))
{
path1.setPieceNodeTrue(graph, iterOldPiece45Path1);
continue;//go to next iterOldPiece45Path1
}
else//if weight reduce,create new piece and erase old piece,return true
{
//path change flag
changeFlagPath1 = PATH1CHANGE;
//attention 1 set points' properties(used/pieceone/piecetwo);2 set pieces' properties;3 delete unused old pieces
emplaceTwo2One(graph, path1, iterOldPiece12Path1, pi13);
emplaceOne2Two(graph, path1, iterOldPiece45Path1, node2Path1, pi42, pi25);
#ifdef MEASURE
timeMeasure.timesUsefulDijkstra += 3;
#endif
#ifdef DEBUG
cout << endl << endl << "@_@:opt3 we optimize path1: insert node: "
<< node2Path1 << " between node: " << node4Path1 << " and node: " << node5Path1 << endl;
path1.printPath();//print vprime node in order
path1.printAllNodeInPath();//print all node in path
#endif
//because iterOldPiece45 will be invalid,we set it to pathListPath1.begin()
iterOldPiece45Path1 = pathListPath1.begin();
//next loopEndNodeId and node2
if (node3Path1 == path1.getVEnd()) node2Path1 = (*(path1.getPathList().begin())).getLastNode();
else node2Path1 = node3Path1;
if (node1Path1 == path1.getVStart()) loopEndNodeIdPath1 = (*(--(path1.getPathList().end()))).getFirstNode();
else loopEndNodeIdPath1 = node1Path1;
break;//go to next node2
}
}//for loop
#ifdef MEASURE
cout << "3optSlow1 dijkstra time all: " << timeMeasure.timeAllDijkstra << " cnt: " << timeMeasure.timesDijkstra << " average time: " <<
float((timeMeasure.timeAllDijkstra) / (float(timeMeasure.timesDijkstra))) << " ms" << endl;
cout << "useful dijkstra times: " << timeMeasure.timesUsefulDijkstra << endl;
#endif
//if node2 can not be inserted to other piece,restore to true
if (iterOldPiece45Path1 == pathListPath1.end())
{
path1.setPieceNodeTrue(graph, iterOldPiece12Path1);
path1.setPieceNodeTrue(graph, iterOldPiece23Path1);
//next new node2
if (node3Path1 == path1.getVEnd())
{
node2Path1 = (*(path1.getPathList().begin())).getLastNode();
}
else
{
node2Path1 = node3Path1;
}
}
//next node 1 3 and iterOldPiece12 and iterOldPiece23
iterOldPiece12Path1 = path1.getPathPieceOne(node2Path1);
iterOldPiece23Path1 = path1.getPathPieceTwo(node2Path1);
node1Path1 = (*iterOldPiece12Path1).getFirstNode();
node3Path1 = (*iterOldPiece23Path1).getLastNode();
//compute loopflag
loopFlagPath1 = (node2Path1 != loopEndNodeIdPath1);
}
//refresh self path's pathedge
path1Edge.refreshPathEdge(graph, path1, path2Edge);
if ((changeFlagPath1 == PATH1NOTCHANGE) && (loopCnt > 1)) break;
//************************for path2**********************
//reset change flag
changeFlagPath2 = PATH2NOTCHANGE;
loopCnt++;
while (loopFlagPath2)//time complexity:O(100 * 100)
{
#ifdef TIMELIMIT
if ((getTime() - timeMeasure.startTime)>TIMELIMITNUM)
{
cout << "3optSlow2 end for time out......" << (getTime() - timeMeasure.startTime) << endl;
break;
}
#endif
//compute the weight decrease of iterOldPiece12 and iterOldPiece23
int node2WeightOldPath2 = computeVPrimeNodeWeight(graph, path2, node2Path2, path1Edge);
//set used property false of old piece, for search path
path2.setPieceNodeFalse(graph, iterOldPiece12Path2);
path2.setPieceNodeFalse(graph, iterOldPiece23Path2);
string searchedNodes123StringPath2 = to_string(node1Path2) + to_string(node2Path2) + to_string(node3Path2);
for (iterOldPiece45Path2 = pathListPath2.begin(); iterOldPiece45Path2 != pathListPath2.end(); ++iterOldPiece45Path2)
{
//get node4 and node5
node4Path2 = (*iterOldPiece45Path2).getFirstNode();
node5Path2 = (*iterOldPiece45Path2).getLastNode();
//check whether have been searched before
string searchedNodesStringPath2 = searchedNodes123StringPath2 + to_string(node4Path2) + to_string(node5Path2);
static int searchedCntPath2 = 0;
if (searchedRecordPath2.count(searchedNodesStringPath2) >= 1)
{
searchedCntPath2++;
//cout << "searchedCntPath2:" << searchedCntPath2 << endl;
continue;
}
else searchedRecordPath2.insert(searchedNodesStringPath2);
//don't get into to the range of sccNum,continue
if (graph.getNode(node5Path2).getSccNum() > graph.getNode(node2Path2).getSccNum()) continue;
//exceeded the range of sccNum,break, should go to next node
if (graph.getNode(node2Path2).getSccNum() > graph.getNode(node4Path2).getSccNum())
{
iterOldPiece45Path2 = pathListPath2.end();
break;
}
//if node2 == node4 or node5, pass
if ((node2Path2 == node4Path2) || (node2Path2 == node5Path2)) continue;
//old weight sum of piece 12 23 45
weightOldPath2 = node2WeightOldPath2 + computePathPieceWeight(graph, path2, iterOldPiece45Path2, path1Edge);
//set used property false of oldpiece, for search path
path2.setPieceNodeFalse(graph, iterOldPiece45Path2);
memset(commonColor, 0, sizeof(int)*(MAXPOINTNUM + 1));
#ifdef SEARCHPATHDIJKSTRA
//when we use MultiPathPieceDijkstra, we must initial commoncolor first
weightNewPath2 = searchMultiPathPieceDijkstra(graph, path2, path1Edge, node1Path2, node3Path2, commonColor, pi13, false);
if (weightNewPath2 < weightOldPath2)
{
setCommonColor(node1Path2, node3Path2, pi13, commonColor);//if we can not find a pathpiece,this set func will get wrong
weightNewPath2 += searchMultiPathPieceDijkstra(graph, path2, path1Edge, node4Path2, node2Path2, commonColor, pi42, false);
if (weightNewPath2 < weightOldPath2)
{
setCommonColor(node4Path2, node2Path2, pi42, commonColor);
weightNewPath2 += searchMultiPathPieceDijkstra(graph, path2, path1Edge, node2Path2, node5Path2, commonColor, pi25, false);
}
}
#endif//SEARCHPATHDIJKSTRA
//if weight do not reduce,restore used property of points
if ((weightNewPath2 >= weightOldPath2))
{
path2.setPieceNodeTrue(graph, iterOldPiece45Path2);
continue;//go to next iterOldPiece45
}
else//if weight reduce,create new piece and erase old piece,return true
{
//path change flag
changeFlagPath2 = PATH2CHANGE;
//attention 1 set points' properties(used/pieceone/piecetwo);2 set pieces' properties;3 delete unused old pieces
emplaceTwo2One(graph, path2, iterOldPiece12Path2, pi13);
emplaceOne2Two(graph, path2, iterOldPiece45Path2, node2Path2, pi42, pi25);
#ifdef MEASURE
timeMeasure.timesUsefulDijkstra += 3;
#endif
#ifdef DEBUG
cout << endl << endl << "@_@:opt3 we optimize path2: insert node: "
<< node2Path2 << " between node: " << node4Path2 << " and node: " << node5Path2 << endl;
path2.printPath();//print vprime node in order
path2.printAllNodeInPath();//print all node in path
#endif
//because iterOldPiece45 will be invalid,we set it to pathListPath2.begin()
iterOldPiece45Path2 = pathListPath2.begin();
//next loopEndNodeId and node2
if (node3Path2 == path2.getVEnd()) node2Path2 = (*(path2.getPathList().begin())).getLastNode();
else node2Path2 = node3Path2;
if (node1Path2 == path2.getVStart()) loopEndNodeIdPath2 = (*(--(path2.getPathList().end()))).getFirstNode();
else loopEndNodeIdPath2 = node1Path2;
break;//go to next node2
}
}//for loop
#ifdef MEASURE
cout << "3optSlow2 dijkstra time all: " << timeMeasure.timeAllDijkstra << " cnt: " << timeMeasure.timesDijkstra << " average time: " <<
float((timeMeasure.timeAllDijkstra) / (float(timeMeasure.timesDijkstra))) << " ms" << endl;
cout << "useful dijkstra times: " << timeMeasure.timesUsefulDijkstra << endl;
#endif
//if node2 can not be inserted to other piece,restore to true
if (iterOldPiece45Path2 == pathListPath2.end())
{
path2.setPieceNodeTrue(graph, iterOldPiece12Path2);
path2.setPieceNodeTrue(graph, iterOldPiece23Path2);
//next new node2
if (node3Path2 == path2.getVEnd())
{
node2Path2 = (*(path2.getPathList().begin())).getLastNode();
}
else
{
node2Path2 = node3Path2;
}
}
//next node 1 3 and iterOldPiece12 and iterOldPiece23
iterOldPiece12Path2 = path2.getPathPieceOne(node2Path2);
iterOldPiece23Path2 = path2.getPathPieceTwo(node2Path2);
node1Path2 = (*iterOldPiece12Path2).getFirstNode();
node3Path2 = (*iterOldPiece23Path2).getLastNode();
//compute loopflag
loopFlagPath2 = (node2Path2 != loopEndNodeIdPath2);
}
//refresh self path's pathedge
path2Edge.refreshPathEdge(graph, path2, path1Edge);
if (changeFlagPath2 == PATH2NOTCHANGE) break;
}
return EXIT_SUCCESS;
}
//here we have 4 nodes and 3 pieces named
//path as follows:
//old path: node1 iterOldPiece12 node2 iterOldPiece23 node3 node4 iterOldPiece45 node5
//new path: node1 iterNewPiece13 node3 node4 iterNewPiece42 node2 iterNewPiece25 node5
int BetaOptimize::threeOptFast(GraphVector &graph, GraphVector &graphReverse, Path &path1, Path &path2, PathEdge &path1Edge, PathEdge &path2Edge)
{
if (graph.getNodeNum() < THREE_OPTBOUNDARIES) return EXIT_SUCCESS;
//enum for flag
enum enumFlag
{
PATH1NOTCHANGE = 2,
PATH1CHANGE = 3,
PATH2NOTCHANGE = 4,
PATH2CHANGE = 5,
PATHLISTSMINIMUM = 3
};
//for search path,save in pi[]
int pi13[MAXPOINTNUM];
int pi42[MAXPOINTNUM];
int pi42Reverse[MAXPOINTNUM];
int pi25[MAXPOINTNUM];
//common color in search path
int commonColor[MAXPOINTNUM + 1];
int commonColorPiece13[MAXPOINTNUM + 1];
//distance for dijkstra,this array will be initialized in dijkstra
int distance25[MAXPOINTNUM + 1];
int distance42Reverse[MAXPOINTNUM + 1];
//times: sum of while(loopPath1) and while(loopPath2)
int loopCnt = 0;
//************************for path1**********************
//pathlist for path
list<PathPiece>& pathListPath1 = path1.getPathList();
//for flag
bool chooseFlagPath1 = (pathListPath1.size() >= PATHLISTSMINIMUM);
int loopFlagPath1 = chooseFlagPath1 ? true : false;
int changeFlagPath1 = PATH1NOTCHANGE;
//for new path
list<PathPiece>::iterator iterNewPiece13Path1;
list<PathPiece>::iterator iterNewPiece42Path1;
list<PathPiece>::iterator iterNewPiece25Path1;
int weightNewPath1 = 0;
//for old path
list<PathPiece>::iterator iterPieceNull;
list<PathPiece>::iterator iterOldPiece12Path1 = chooseFlagPath1 ? pathListPath1.begin() : iterPieceNull;
list<PathPiece>::iterator iterOldPiece23Path1 = chooseFlagPath1 ? (++(pathListPath1.begin())) : iterPieceNull;
list<PathPiece>::iterator iterOldPiece45Path1;
int weightOldPath1;
//node id num,initial to be the last vprime point in path
int loopEndNodeIdPath1 = chooseFlagPath1 ? (*(--(pathListPath1.end()))).getFirstNode() : INVALID;
//old node id
int node1Path1 = chooseFlagPath1 ? (*iterOldPiece12Path1).getFirstNode() : INVALID;
int node2Path1 = chooseFlagPath1 ? (*iterOldPiece12Path1).getLastNode() : INVALID;
int node3Path1 = chooseFlagPath1 ? (*iterOldPiece23Path1).getLastNode() : INVALID;
int node4Path1;
int node5Path1;
//save points that have been searched
unordered_set<string> searchedRecordPath1;
//************************for path2**********************
//pathlist for path
list<PathPiece>& pathListPath2 = path2.getPathList();
//for flag
bool chooseFlagPath2 = (pathListPath2.size() >= PATHLISTSMINIMUM);
int loopFlagPath2 = chooseFlagPath2 ? true : false;
int changeFlagPath2 = PATH2NOTCHANGE;
//for new path
list<PathPiece>::iterator iterNewPiece13Path2;
list<PathPiece>::iterator iterNewPiece42Path2;
list<PathPiece>::iterator iterNewPiece25Path2;
int weightNewPath2 = 0;
//for old path
list<PathPiece>::iterator iterOldPiece12Path2 = chooseFlagPath2 ? pathListPath2.begin() : iterPieceNull;
list<PathPiece>::iterator iterOldPiece23Path2 = chooseFlagPath2 ? (++(pathListPath2.begin())) : iterPieceNull;
list<PathPiece>::iterator iterOldPiece45Path2;
int weightOldPath2;
//node id num,initial to be the last vprime point in path
int loopEndNodeIdPath2 = chooseFlagPath2 ? (*(--(pathListPath2.end()))).getFirstNode() : INVALID;
//old node id
int node1Path2 = chooseFlagPath2 ? (*iterOldPiece12Path2).getFirstNode() : INVALID;
int node2Path2 = chooseFlagPath2 ? (*iterOldPiece12Path2).getLastNode() : INVALID;
int node3Path2 = chooseFlagPath2 ? (*iterOldPiece23Path2).getLastNode() : INVALID;
int node4Path2;
int node5Path2;
//save points that have been searched
unordered_set<string> searchedRecordPath2;
while (true)
{
//************************for path1**********************
//reset change flag
changeFlagPath1 = PATH1NOTCHANGE;
loopCnt++;
while (loopFlagPath1)//time complexity:O(100 * 100)
{
#ifdef TIMELIMIT
if ((getTime() - timeMeasure.startTime)>TIMELIMITNUM)
{
cout << "3optFast1 end for time out......" << (getTime() - timeMeasure.startTime) << endl;
break;
}
#endif
//compute the weight decrease of iterOldPiece12 and iterOldPiece23
int node2WeightOldPath1 = computeVPrimeNodeWeight(graph, path1, node2Path1, path2Edge);
//set used property false of old piece, for search path
path1.setPieceNodeFalse(graph, iterOldPiece12Path1);
path1.setPieceNodeFalse(graph, iterOldPiece23Path1);
//string: node1 node2 node3
string searchedNodes123StringPath1 = to_string(node1Path1) + to_string(node2Path1) + to_string(node3Path1);
//find new piece13
memset(commonColorPiece13, 0, sizeof(int)*(MAXPOINTNUM + 1));
int piece13WeightNewPath1 = searchMultiPathPieceDijkstra(graph, path1, path2Edge, node1Path1, node3Path1, commonColorPiece13, pi13, false);
//if we can not find a pathpiece13
if (piece13WeightNewPath1 >= INFINITEWEIGHT)
{
iterOldPiece45Path1 = pathListPath1.end();
goto endForLoopPath1;
}
else
{
//attention:must can find a pathpiece of dijkstra, if we can not find a pathpiece,this set func will get wrong
setCommonColor(node1Path1, node3Path1, pi13, commonColorPiece13);
}
//note: here has a problem, when newpiece42 and newpiece25 has common vpoint, we need to redijkstra again in for loop!!!
//find all piece25, attention: all !
searchMultiPathPieceDijkstra(graph, path1, path2Edge, node2Path1, distance25, commonColorPiece13, pi25, false);
//find all piece42, attention: all !; actually we use reverse graph to find all dij path from node2
memset(pi42Reverse, 0xff, sizeof(int)*(MAXPOINTNUM));
searchMultiPathPieceDijkstra(graphReverse, path1, path2Edge, node2Path1, distance42Reverse, commonColorPiece13, pi42Reverse, false);
for (iterOldPiece45Path1 = pathListPath1.begin(); iterOldPiece45Path1 != pathListPath1.end(); ++iterOldPiece45Path1)
{
//get node4 and node5
node4Path1 = (*iterOldPiece45Path1).getFirstNode();
node5Path1 = (*iterOldPiece45Path1).getLastNode();
//check whether have been searched before
string searchedNodesStringPath1 = searchedNodes123StringPath1 + to_string(node4Path1) + to_string(node5Path1);
static int searchedCntPath1 = 0;
if (searchedRecordPath1.count(searchedNodesStringPath1) >= 1)
{
searchedCntPath1++;
//cout << "searchedCntPath1:" << searchedCntPath1 << endl;
continue;
}
else searchedRecordPath1.insert(searchedNodesStringPath1);
//don't get into to the range of sccNum,continue
if (graph.getNode(node5Path1).getSccNum() > graph.getNode(node2Path1).getSccNum()) continue;
//exceeded the range of sccNum,break, should go to next node
if (graph.getNode(node2Path1).getSccNum() > graph.getNode(node4Path1).getSccNum())
{
iterOldPiece45Path1 = pathListPath1.end();
break;
}
//if node2 == node4 or node5, pass
if ((node2Path1 == node4Path1) || (node2Path1 == node5Path1)) continue;
//old weight sum of piece 12 23 45
weightOldPath1 = node2WeightOldPath1 + computePathPieceWeight(graph, path1, iterOldPiece45Path1, path2Edge);
//set used property false of oldpiece, for search path
path1.setPieceNodeFalse(graph, iterOldPiece45Path1);
//because we have memcpy,we do not need to memset now
//memset(commonColor, 0, sizeof(int)*(MAXPOINTNUM + 1));
#ifdef SEARCHPATHDIJKSTRA
//when can not find a pathpiece from node2 to node5, the distance will be very large
weightNewPath1 = piece13WeightNewPath1 + distance25[node5Path1];
if ((piece13WeightNewPath1 + distance42Reverse[node4Path1]) > weightOldPath1)
weightNewPath1 = weightOldPath1 + 10000;
if (weightNewPath1 < weightOldPath1)
{
//check whether newpiece42 and newpiece25 have common vpoint
if (haveCommonNode(node2Path1, node5Path1, pi25, node2Path1, node4Path1, pi42Reverse))
{
memcpy(commonColor, commonColorPiece13, sizeof(int)*(MAXPOINTNUM + 1));
setCommonColor(node2Path1, node5Path1, pi25, commonColor);
weightNewPath1 += searchMultiPathPieceDijkstra(graph, path1, path2Edge, node4Path1, node2Path1, commonColor, pi42, false);
}
else
{
weightNewPath1 += distance42Reverse[node4Path1];
//reverse pi42Reverse to pi42
if (weightNewPath1 < weightOldPath1)
{
reversePi(node2Path1, node4Path1, pi42Reverse, pi42);
}
}
}
#endif//SEARCHPATHDIJKSTRA
//if weight do not reduce,restore used property of points
if ((weightNewPath1 >= weightOldPath1))
{
path1.setPieceNodeTrue(graph, iterOldPiece45Path1);
continue;//go to next iterOldPiece45Path1
}
else//if weight reduce,create new piece and erase old piece,return true
{
//path change flag
changeFlagPath1 = PATH1CHANGE;
//attention 1 set points' properties(used/pieceone/piecetwo);2 set pieces' properties;3 delete unused old pieces
emplaceTwo2One(graph, path1, iterOldPiece12Path1, pi13);
emplaceOne2Two(graph, path1, iterOldPiece45Path1, node2Path1, pi42, pi25);
#ifdef MEASURE
timeMeasure.timesUsefulDijkstra += 3;
#endif
#ifdef DEBUG
cout << endl << endl << "@_@:opt3 we optimize path1: insert node: "
<< node2Path1 << " between node: " << node4Path1 << " and node: " << node5Path1 << endl;
path1.printPath();//print vprime node in order
path1.printAllNodeInPath();//print all node in path
#endif
//because iterOldPiece45 will be invalid,we set it to pathListPath1.begin()
iterOldPiece45Path1 = pathListPath1.begin();
//next loopEndNodeId and node2
if (node3Path1 == path1.getVEnd()) node2Path1 = (*(path1.getPathList().begin())).getLastNode();
else node2Path1 = node3Path1;
if (node1Path1 == path1.getVStart()) loopEndNodeIdPath1 = (*(--(path1.getPathList().end()))).getFirstNode();
else loopEndNodeIdPath1 = node1Path1;
break;//go to next node2
}
}//for loop
#ifdef MEASURE
cout << "3optFast1 dijkstra time all: " << timeMeasure.timeAllDijkstra << " cnt: " << timeMeasure.timesDijkstra << " average time: " <<
float((timeMeasure.timeAllDijkstra) / (float(timeMeasure.timesDijkstra))) << " ms" <<endl;
cout << "useful dijkstra times: " << timeMeasure.timesUsefulDijkstra << endl;
#endif
endForLoopPath1:
//if node2 can not be inserted to other piece,restore to true
if (iterOldPiece45Path1 == pathListPath1.end())
{
path1.setPieceNodeTrue(graph, iterOldPiece12Path1);
path1.setPieceNodeTrue(graph, iterOldPiece23Path1);
//next new node2
if (node3Path1 == path1.getVEnd())
{
node2Path1 = (*(path1.getPathList().begin())).getLastNode();
}
else
{
node2Path1 = node3Path1;
}
}
//next node 1 3 and iterOldPiece12 and iterOldPiece23
iterOldPiece12Path1 = path1.getPathPieceOne(node2Path1);
iterOldPiece23Path1 = path1.getPathPieceTwo(node2Path1);
node1Path1 = (*iterOldPiece12Path1).getFirstNode();
node3Path1 = (*iterOldPiece23Path1).getLastNode();
//compute loopflag
loopFlagPath1 = (node2Path1 != loopEndNodeIdPath1);
}//while (loopFlagPath1)
//if only have 0 or 1 vprime point
if (path1.getVPrimeSize() == 0)
{
weightOldPath1 = computePathPieceWeight(graph, path1, pathListPath1.begin(), path2Edge);
path1.setPieceNodeFalse(graph, pathListPath1.begin());
weightNewPath1 = searchMultiPathPieceDijkstra(graph, path1, path2Edge, path1.getVStart(), path1.getVEnd(), commonColor, pi13, false);
if (weightNewPath1 < weightOldPath1)
{
emplaceOne2One(graph, path1, pathListPath1.begin(), pi13);
}
else
{
path1.setPieceNodeTrue(graph, pathListPath1.begin());
}
}
else if (path1.getVPrimeSize() == 1)
{
for (auto iterOldPieceTempPath1 = pathListPath1.begin(); iterOldPieceTempPath1 != pathListPath1.end(); ++iterOldPieceTempPath1)
{
path1.setPieceNodeFalse(graph, iterOldPieceTempPath1);
}
node2Path1 = (*(pathListPath1.begin())).getLastNode();
node4Path1 = path1.getVStart();
node5Path1 = path1.getVEnd();
weightOldPath1 = computeVPrimeNodeWeight(graph, path1, node2Path1, path2Edge);
memset(commonColor, 0, sizeof(int)*(MAXPOINTNUM + 1));
weightNewPath1 = searchMultiPathPieceDijkstra(graph, path1, path2Edge, node4Path1, node2Path1, commonColor, pi42, false);
if (weightNewPath1 < weightOldPath1)
{
setCommonColor(node4Path1, node2Path1, pi42, commonColor);
weightNewPath1 += searchMultiPathPieceDijkstra(graph, path1, path2Edge, node2Path1, node5Path1, commonColor, pi25, false);
}
//if weight do not reduce,restore used property of points
if ((weightNewPath1 >= weightOldPath1))
{
path1.setPieceNodeTrue(graph, pathListPath1.begin());
path1.setPieceNodeTrue(graph, (++(pathListPath1.begin())));
}
else//if weight reduce,create new piece and erase old piece,return true
{
//path change flag
changeFlagPath1 = PATH1CHANGE;
//attention 1 set points' properties(used/pieceone/piecetwo);2 set pieces' properties;3 delete unused old pieces
emplaceTwo2Two(graph, path1, pathListPath1.begin(), node2Path1, pi42, pi25);
}
}
//refresh self path's pathedge
path1Edge.refreshPathEdge(graph, path1, path2Edge);
loopFlagPath1 = chooseFlagPath1 ? true : false;
if ((changeFlagPath1 == PATH1NOTCHANGE) && (loopCnt > 1)) break;
//************************for path2**********************
//reset change flag
changeFlagPath2 = PATH2NOTCHANGE;
loopCnt++;
while (loopFlagPath2)//time complexity:O(100 * 100)
{
#ifdef TIMELIMIT
if ((getTime() - timeMeasure.startTime)>TIMELIMITNUM)
{
cout << "3optFast2 end for time out......" << (getTime() - timeMeasure.startTime) << endl;
break;
}
#endif
//compute the weight decrease of iterOldPiece12 and iterOldPiece23
int node2WeightOldPath2 = computeVPrimeNodeWeight(graph, path2, node2Path2, path1Edge);
//set used property false of old piece, for search path
path2.setPieceNodeFalse(graph, iterOldPiece12Path2);
path2.setPieceNodeFalse(graph, iterOldPiece23Path2);
string searchedNodes123StringPath2 = to_string(node1Path2) + to_string(node2Path2) + to_string(node3Path2);
//find new piece13
memset(commonColorPiece13, 0, sizeof(int)*(MAXPOINTNUM + 1));
int piece13WeightNewPath2 = searchMultiPathPieceDijkstra(graph, path2, path1Edge, node1Path2, node3Path2, commonColorPiece13, pi13, false);
//if we can not find a pathpiece13
if (piece13WeightNewPath2 >= INFINITEWEIGHT)
{
iterOldPiece45Path2 = pathListPath2.end();
goto endForLoopPath2;
}
else
{
//attention:must can find a pathpiece of dijkstra, if we can not find a pathpiece,this set func will get wrong
setCommonColor(node1Path2, node3Path2, pi13, commonColorPiece13);
}
//note: here has a problem, when newpiece42 and newpiece25 has common vpoint, we need to redijkstra again in for loop!!!
//find all piece25, attention: all !
searchMultiPathPieceDijkstra(graph, path2, path1Edge, node2Path2, distance25, commonColorPiece13, pi25, false);
//find all piece42, attention: all !; actually we use reverse graph to find all dij path from node2
memset(pi42Reverse, 0xff, sizeof(int)*(MAXPOINTNUM));
searchMultiPathPieceDijkstra(graphReverse, path2, path1Edge, node2Path2, distance42Reverse, commonColorPiece13, pi42Reverse, false);
for (iterOldPiece45Path2 = pathListPath2.begin(); iterOldPiece45Path2 != pathListPath2.end(); ++iterOldPiece45Path2)
{
//get node4 and node5
node4Path2 = (*iterOldPiece45Path2).getFirstNode();
node5Path2 = (*iterOldPiece45Path2).getLastNode();
//check whether have been searched before
string searchedNodesStringPath2 = searchedNodes123StringPath2 + to_string(node4Path2) + to_string(node5Path2);
static int searchedCntPath2 = 0;
if (searchedRecordPath2.count(searchedNodesStringPath2) >= 1)
{
searchedCntPath2++;
//cout << "searchedCntPath2:" << searchedCntPath2 << endl;
continue;
}
else searchedRecordPath2.insert(searchedNodesStringPath2);
//don't get into to the range of sccNum,continue
if (graph.getNode(node5Path2).getSccNum() > graph.getNode(node2Path2).getSccNum()) continue;
//exceeded the range of sccNum,break, should go to next node
if (graph.getNode(node2Path2).getSccNum() > graph.getNode(node4Path2).getSccNum())
{
iterOldPiece45Path2 = pathListPath2.end();
break;
}
//if node2 == node4 or node5, pass
if ((node2Path2 == node4Path2) || (node2Path2 == node5Path2)) continue;
//old weight sum of piece 12 23 45
weightOldPath2 = node2WeightOldPath2 + computePathPieceWeight(graph, path2, iterOldPiece45Path2, path1Edge);
//set used property false of oldpiece, for search path
path2.setPieceNodeFalse(graph, iterOldPiece45Path2);
//because we have memcpy,we do not need to memset now
//memset(commonColor, 0, sizeof(int)*(MAXPOINTNUM + 1));
#ifdef SEARCHPATHDIJKSTRA
//when can not find a pathpiece from node2 to node5, the distance will be very large
weightNewPath2 = piece13WeightNewPath2 + distance25[node5Path2];
if ((piece13WeightNewPath2 + distance42Reverse[node4Path2]) > weightOldPath2)
weightNewPath2 = weightOldPath2 + 10000;
if (weightNewPath2 < weightOldPath2)
{
//check whether newpiece42 and newpiece25 have common vpoint
if (haveCommonNode(node2Path2, node5Path2, pi25, node2Path2, node4Path2, pi42Reverse))
{
memcpy(commonColor, commonColorPiece13, sizeof(int)*(MAXPOINTNUM + 1));
setCommonColor(node2Path2, node5Path2, pi25, commonColor);
weightNewPath2 += searchMultiPathPieceDijkstra(graph, path2, path1Edge, node4Path2, node2Path2, commonColor, pi42, false);
}
else
{
weightNewPath2 += distance42Reverse[node4Path2];
//reverse pi42Reverse to pi42
if (weightNewPath2 < weightOldPath2)
{
reversePi(node2Path2, node4Path2, pi42Reverse, pi42);