forked from coin-or/Clp
-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathClpNetworkBasis.cpp
1170 lines (1160 loc) · 33.4 KB
/
ClpNetworkBasis.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
/* $Id$ */
// Copyright (C) 2003, International Business Machines
// Corporation and others. All Rights Reserved.
// This code is licensed under the terms of the Eclipse Public License (EPL).
#include "CoinPragma.hpp"
#include "ClpNetworkBasis.hpp"
#include "CoinHelperFunctions.hpp"
#include "ClpSimplex.hpp"
#include "ClpMatrixBase.hpp"
#include "CoinIndexedVector.hpp"
//#############################################################################
// Constructors / Destructor / Assignment
//#############################################################################
//-------------------------------------------------------------------
// Default Constructor
//-------------------------------------------------------------------
ClpNetworkBasis::ClpNetworkBasis()
{
#ifndef COIN_FAST_CODE
slackValue_ = -1.0;
#endif
numberRows_ = 0;
numberColumns_ = 0;
parent_ = NULL;
descendant_ = NULL;
pivot_ = NULL;
rightSibling_ = NULL;
leftSibling_ = NULL;
sign_ = NULL;
stack_ = NULL;
permute_ = NULL;
permuteBack_ = NULL;
stack2_ = NULL;
depth_ = NULL;
mark_ = NULL;
model_ = NULL;
}
// Constructor from CoinFactorization
ClpNetworkBasis::ClpNetworkBasis(const ClpSimplex *model,
int numberRows, const CoinFactorizationDouble *pivotRegion,
const int *permuteBack,
const int *startColumn,
const int *numberInColumn,
const int *indexRow, const CoinFactorizationDouble * /*element*/)
{
#ifndef COIN_FAST_CODE
slackValue_ = -1.0;
#endif
numberRows_ = numberRows;
numberColumns_ = numberRows;
parent_ = new int[numberRows_ + 1];
descendant_ = new int[numberRows_ + 1];
pivot_ = new int[numberRows_ + 1];
rightSibling_ = new int[numberRows_ + 1];
leftSibling_ = new int[numberRows_ + 1];
sign_ = new double[numberRows_ + 1];
stack_ = new int[numberRows_ + 1];
stack2_ = new int[numberRows_ + 1];
depth_ = new int[numberRows_ + 1];
mark_ = new char[numberRows_ + 1];
permute_ = new int[numberRows_ + 1];
permuteBack_ = new int[numberRows_ + 1];
int i;
for (i = 0; i < numberRows_ + 1; i++) {
parent_[i] = -1;
descendant_[i] = -1;
pivot_[i] = -1;
rightSibling_[i] = -1;
leftSibling_[i] = -1;
sign_[i] = -1.0;
stack_[i] = -1;
permute_[i] = i;
permuteBack_[i] = i;
stack2_[i] = -1;
depth_[i] = -1;
mark_[i] = 0;
}
mark_[numberRows_] = 1;
// pivotColumnBack gives order of pivoting into basis
// so pivotColumnback[0] is first slack in basis and
// it pivots on row permuteBack[0]
// a known root is given by permuteBack[numberRows_-1]
for (i = 0; i < numberRows_; i++) {
int iPivot = permuteBack[i];
double sign;
if (pivotRegion[i] > 0.0)
sign = 1.0;
else
sign = -1.0;
int other;
if (numberInColumn[i] > 0) {
int iRow = indexRow[startColumn[i]];
other = permuteBack[iRow];
//assert (parent_[other]!=-1);
} else {
other = numberRows_;
}
sign_[iPivot] = sign;
int iParent = other;
parent_[iPivot] = other;
if (descendant_[iParent] >= 0) {
// we have a sibling
int iRight = descendant_[iParent];
rightSibling_[iPivot] = iRight;
leftSibling_[iRight] = iPivot;
} else {
rightSibling_[iPivot] = -1;
}
descendant_[iParent] = iPivot;
leftSibling_[iPivot] = -1;
}
// do depth
int nStack = 1;
stack_[0] = descendant_[numberRows_];
depth_[numberRows_] = -1; // root
while (nStack) {
// take off
int iNext = stack_[--nStack];
if (iNext >= 0) {
depth_[iNext] = nStack;
int iRight = rightSibling_[iNext];
stack_[nStack++] = iRight;
if (descendant_[iNext] >= 0)
stack_[nStack++] = descendant_[iNext];
}
}
model_ = model;
check();
}
//-------------------------------------------------------------------
// Copy constructor
//-------------------------------------------------------------------
ClpNetworkBasis::ClpNetworkBasis(const ClpNetworkBasis &rhs)
{
#ifndef COIN_FAST_CODE
slackValue_ = rhs.slackValue_;
#endif
numberRows_ = rhs.numberRows_;
numberColumns_ = rhs.numberColumns_;
if (rhs.parent_) {
parent_ = new int[numberRows_ + 1];
CoinMemcpyN(rhs.parent_, (numberRows_ + 1), parent_);
} else {
parent_ = NULL;
}
if (rhs.descendant_) {
descendant_ = new int[numberRows_ + 1];
CoinMemcpyN(rhs.descendant_, (numberRows_ + 1), descendant_);
} else {
descendant_ = NULL;
}
if (rhs.pivot_) {
pivot_ = new int[numberRows_ + 1];
CoinMemcpyN(rhs.pivot_, (numberRows_ + 1), pivot_);
} else {
pivot_ = NULL;
}
if (rhs.rightSibling_) {
rightSibling_ = new int[numberRows_ + 1];
CoinMemcpyN(rhs.rightSibling_, (numberRows_ + 1), rightSibling_);
} else {
rightSibling_ = NULL;
}
if (rhs.leftSibling_) {
leftSibling_ = new int[numberRows_ + 1];
CoinMemcpyN(rhs.leftSibling_, (numberRows_ + 1), leftSibling_);
} else {
leftSibling_ = NULL;
}
if (rhs.sign_) {
sign_ = new double[numberRows_ + 1];
CoinMemcpyN(rhs.sign_, (numberRows_ + 1), sign_);
} else {
sign_ = NULL;
}
if (rhs.stack_) {
stack_ = new int[numberRows_ + 1];
CoinMemcpyN(rhs.stack_, (numberRows_ + 1), stack_);
} else {
stack_ = NULL;
}
if (rhs.permute_) {
permute_ = new int[numberRows_ + 1];
CoinMemcpyN(rhs.permute_, (numberRows_ + 1), permute_);
} else {
permute_ = NULL;
}
if (rhs.permuteBack_) {
permuteBack_ = new int[numberRows_ + 1];
CoinMemcpyN(rhs.permuteBack_, (numberRows_ + 1), permuteBack_);
} else {
permuteBack_ = NULL;
}
if (rhs.stack2_) {
stack2_ = new int[numberRows_ + 1];
CoinMemcpyN(rhs.stack2_, (numberRows_ + 1), stack2_);
} else {
stack2_ = NULL;
}
if (rhs.depth_) {
depth_ = new int[numberRows_ + 1];
CoinMemcpyN(rhs.depth_, (numberRows_ + 1), depth_);
} else {
depth_ = NULL;
}
if (rhs.mark_) {
mark_ = new char[numberRows_ + 1];
CoinMemcpyN(rhs.mark_, (numberRows_ + 1), mark_);
} else {
mark_ = NULL;
}
model_ = rhs.model_;
}
//-------------------------------------------------------------------
// Destructor
//-------------------------------------------------------------------
ClpNetworkBasis::~ClpNetworkBasis()
{
delete[] parent_;
delete[] descendant_;
delete[] pivot_;
delete[] rightSibling_;
delete[] leftSibling_;
delete[] sign_;
delete[] stack_;
delete[] permute_;
delete[] permuteBack_;
delete[] stack2_;
delete[] depth_;
delete[] mark_;
}
//----------------------------------------------------------------
// Assignment operator
//-------------------------------------------------------------------
ClpNetworkBasis &
ClpNetworkBasis::operator=(const ClpNetworkBasis &rhs)
{
if (this != &rhs) {
delete[] parent_;
delete[] descendant_;
delete[] pivot_;
delete[] rightSibling_;
delete[] leftSibling_;
delete[] sign_;
delete[] stack_;
delete[] permute_;
delete[] permuteBack_;
delete[] stack2_;
delete[] depth_;
delete[] mark_;
#ifndef COIN_FAST_CODE
slackValue_ = rhs.slackValue_;
#endif
numberRows_ = rhs.numberRows_;
numberColumns_ = rhs.numberColumns_;
if (rhs.parent_) {
parent_ = new int[numberRows_ + 1];
CoinMemcpyN(rhs.parent_, (numberRows_ + 1), parent_);
} else {
parent_ = NULL;
}
if (rhs.descendant_) {
descendant_ = new int[numberRows_ + 1];
CoinMemcpyN(rhs.descendant_, (numberRows_ + 1), descendant_);
} else {
descendant_ = NULL;
}
if (rhs.pivot_) {
pivot_ = new int[numberRows_ + 1];
CoinMemcpyN(rhs.pivot_, (numberRows_ + 1), pivot_);
} else {
pivot_ = NULL;
}
if (rhs.rightSibling_) {
rightSibling_ = new int[numberRows_ + 1];
CoinMemcpyN(rhs.rightSibling_, (numberRows_ + 1), rightSibling_);
} else {
rightSibling_ = NULL;
}
if (rhs.leftSibling_) {
leftSibling_ = new int[numberRows_ + 1];
CoinMemcpyN(rhs.leftSibling_, (numberRows_ + 1), leftSibling_);
} else {
leftSibling_ = NULL;
}
if (rhs.sign_) {
sign_ = new double[numberRows_ + 1];
CoinMemcpyN(rhs.sign_, (numberRows_ + 1), sign_);
} else {
sign_ = NULL;
}
if (rhs.stack_) {
stack_ = new int[numberRows_ + 1];
CoinMemcpyN(rhs.stack_, (numberRows_ + 1), stack_);
} else {
stack_ = NULL;
}
if (rhs.permute_) {
permute_ = new int[numberRows_ + 1];
CoinMemcpyN(rhs.permute_, (numberRows_ + 1), permute_);
} else {
permute_ = NULL;
}
if (rhs.permuteBack_) {
permuteBack_ = new int[numberRows_ + 1];
CoinMemcpyN(rhs.permuteBack_, (numberRows_ + 1), permuteBack_);
} else {
permuteBack_ = NULL;
}
if (rhs.stack2_) {
stack2_ = new int[numberRows_ + 1];
CoinMemcpyN(rhs.stack2_, (numberRows_ + 1), stack2_);
} else {
stack2_ = NULL;
}
if (rhs.depth_) {
depth_ = new int[numberRows_ + 1];
CoinMemcpyN(rhs.depth_, (numberRows_ + 1), depth_);
} else {
depth_ = NULL;
}
if (rhs.mark_) {
mark_ = new char[numberRows_ + 1];
CoinMemcpyN(rhs.mark_, (numberRows_ + 1), mark_);
} else {
mark_ = NULL;
}
}
return *this;
}
// checks looks okay
void ClpNetworkBasis::check()
{
// check depth
int nStack = 1;
stack_[0] = descendant_[numberRows_];
depth_[numberRows_] = -1; // root
while (nStack) {
// take off
int iNext = stack_[--nStack];
if (iNext >= 0) {
//assert (depth_[iNext]==nStack);
depth_[iNext] = nStack;
int iRight = rightSibling_[iNext];
stack_[nStack++] = iRight;
if (descendant_[iNext] >= 0)
stack_[nStack++] = descendant_[iNext];
}
}
}
// prints
void ClpNetworkBasis::print()
{
int i;
printf(" parent descendant left right sign depth\n");
for (i = 0; i < numberRows_ + 1; i++)
printf("%4d %7d %8d %7d %7d %5g %7d\n",
i, parent_[i], descendant_[i], leftSibling_[i], rightSibling_[i],
sign_[i], depth_[i]);
}
/* Replaces one Column to basis,
returns 0=OK
*/
int ClpNetworkBasis::replaceColumn(CoinIndexedVector *regionSparse,
int pivotRow)
{
// When things have settled down then redo this to make more elegant
// I am sure lots of loops can be combined
// regionSparse is empty
assert(!regionSparse->getNumElements());
model_->unpack(regionSparse, model_->sequenceIn());
// arc given by pivotRow is leaving basis
//int kParent = parent_[pivotRow];
// arc coming in has these two nodes
int *indices = regionSparse->getIndices();
int iRow0 = indices[0];
int iRow1;
if (regionSparse->getNumElements() == 2)
iRow1 = indices[1];
else
iRow1 = numberRows_;
double sign = -regionSparse->denseVector()[iRow0];
regionSparse->clear();
// and outgoing
model_->unpack(regionSparse, model_->pivotVariable()[pivotRow]);
int jRow0 = indices[0];
int jRow1;
if (regionSparse->getNumElements() == 2)
jRow1 = indices[1];
else
jRow1 = numberRows_;
regionSparse->clear();
// get correct pivotRow
//#define FULL_DEBUG
#ifdef FULL_DEBUG
printf("irow %d %d, jrow %d %d\n",
iRow0, iRow1, jRow0, jRow1);
#endif
if (parent_[jRow0] == jRow1) {
int newPivot = jRow0;
if (newPivot != pivotRow) {
#ifdef FULL_DEBUG
printf("pivot row of %d permuted to %d\n", pivotRow, newPivot);
#endif
pivotRow = newPivot;
}
} else {
//assert (parent_[jRow1]==jRow0);
int newPivot = jRow1;
if (newPivot != pivotRow) {
#ifdef FULL_DEBUG
printf("pivot row of %d permuted to %d\n", pivotRow, newPivot);
#endif
pivotRow = newPivot;
}
}
bool extraPrint = (model_->numberIterations() > -3) && (model_->logLevel() > 10);
if (extraPrint)
print();
#ifdef FULL_DEBUG
printf("In %d (region= %g, stored %g) %d (%g) pivoting on %d (%g)\n",
iRow1, sign, sign_[iRow1], iRow0, sign_[iRow0], pivotRow, sign_[pivotRow]);
#endif
// see which path outgoing pivot is on
int kRow = -1;
int jRow = iRow1;
while (jRow != numberRows_) {
if (jRow == pivotRow) {
kRow = iRow1;
break;
} else {
jRow = parent_[jRow];
}
}
if (kRow < 0) {
jRow = iRow0;
while (jRow != numberRows_) {
if (jRow == pivotRow) {
kRow = iRow0;
break;
} else {
jRow = parent_[jRow];
}
}
}
//assert (kRow>=0);
if (iRow0 == kRow) {
iRow0 = iRow1;
iRow1 = kRow;
sign = -sign;
}
// pivot row is on path from iRow1 back to root
// get stack of nodes to change
// Also get precursors for cleaning order
int nStack = 1;
stack_[0] = iRow0;
while (kRow != pivotRow) {
stack_[nStack++] = kRow;
if (sign * sign_[kRow] < 0.0) {
sign_[kRow] = -sign_[kRow];
} else {
sign = -sign;
}
kRow = parent_[kRow];
//sign *= sign_[kRow];
}
stack_[nStack++] = pivotRow;
if (sign * sign_[pivotRow] < 0.0) {
sign_[pivotRow] = -sign_[pivotRow];
} else {
sign = -sign;
}
int iParent = parent_[pivotRow];
while (nStack > 1) {
int iLeft;
int iRight;
kRow = stack_[--nStack];
int newParent = stack_[nStack - 1];
#ifdef FULL_DEBUG
printf("row %d, old parent %d, new parent %d, pivotrow %d\n", kRow,
iParent, newParent, pivotRow);
#endif
int i1 = permuteBack_[pivotRow];
int i2 = permuteBack_[kRow];
permuteBack_[pivotRow] = i2;
permuteBack_[kRow] = i1;
// do Btran permutation
permute_[i1] = kRow;
permute_[i2] = pivotRow;
pivotRow = kRow;
// Take out of old parent
iLeft = leftSibling_[kRow];
iRight = rightSibling_[kRow];
if (iLeft < 0) {
// take out of tree
if (iRight >= 0) {
leftSibling_[iRight] = iLeft;
descendant_[iParent] = iRight;
} else {
#ifdef FULL_DEBUG
printf("Saying %d (old parent of %d) has no descendants\n",
iParent, kRow);
#endif
descendant_[iParent] = -1;
}
} else {
// take out of tree
rightSibling_[iLeft] = iRight;
if (iRight >= 0)
leftSibling_[iRight] = iLeft;
}
leftSibling_[kRow] = -1;
rightSibling_[kRow] = -1;
// now insert new one
// make this descendant of that
if (descendant_[newParent] >= 0) {
// we will have a sibling
int jRight = descendant_[newParent];
rightSibling_[kRow] = jRight;
leftSibling_[jRight] = kRow;
} else {
rightSibling_[kRow] = -1;
}
descendant_[newParent] = kRow;
leftSibling_[kRow] = -1;
parent_[kRow] = newParent;
iParent = kRow;
}
// now redo all depths from stack_[1]
// This must be possible to combine - but later
{
int iPivot = stack_[1];
int iDepth = depth_[parent_[iPivot]]; //depth of parent
iDepth++; //correct for this one
int nStack = 1;
stack_[0] = iPivot;
while (nStack) {
// take off
int iNext = stack_[--nStack];
if (iNext >= 0) {
// add stack level
depth_[iNext] = nStack + iDepth;
stack_[nStack++] = rightSibling_[iNext];
if (descendant_[iNext] >= 0)
stack_[nStack++] = descendant_[iNext];
}
}
}
if (extraPrint)
print();
//check();
return 0;
}
/* Updates one column (FTRAN) from region2 */
double
ClpNetworkBasis::updateColumn(CoinIndexedVector *regionSparse,
CoinIndexedVector *regionSparse2,
int pivotRow)
{
regionSparse->clear();
double *region = regionSparse->denseVector();
double *region2 = regionSparse2->denseVector();
int *regionIndex2 = regionSparse2->getIndices();
int numberNonZero = regionSparse2->getNumElements();
int *regionIndex = regionSparse->getIndices();
int i;
bool doTwo = (numberNonZero == 2);
int i0 = -1;
int i1 = -1;
if (doTwo) {
i0 = regionIndex2[0];
i1 = regionIndex2[1];
}
double returnValue = 0.0;
bool packed = regionSparse2->packedMode();
if (packed) {
if (doTwo && region2[0] * region2[1] < 0.0) {
region[i0] = region2[0];
region2[0] = 0.0;
region[i1] = region2[1];
region2[1] = 0.0;
int iDepth0 = depth_[i0];
int iDepth1 = depth_[i1];
if (iDepth1 > iDepth0) {
int temp = i0;
i0 = i1;
i1 = temp;
temp = iDepth0;
iDepth0 = iDepth1;
iDepth1 = temp;
}
numberNonZero = 0;
if (pivotRow < 0) {
while (iDepth0 > iDepth1) {
double pivotValue = region[i0];
// put back now ?
int iBack = permuteBack_[i0];
region2[numberNonZero] = pivotValue * sign_[i0];
regionIndex2[numberNonZero++] = iBack;
int otherRow = parent_[i0];
region[i0] = 0.0;
region[otherRow] += pivotValue;
iDepth0--;
i0 = otherRow;
}
while (i0 != i1) {
double pivotValue = region[i0];
// put back now ?
int iBack = permuteBack_[i0];
region2[numberNonZero] = pivotValue * sign_[i0];
regionIndex2[numberNonZero++] = iBack;
int otherRow = parent_[i0];
region[i0] = 0.0;
region[otherRow] += pivotValue;
i0 = otherRow;
double pivotValue1 = region[i1];
// put back now ?
int iBack1 = permuteBack_[i1];
region2[numberNonZero] = pivotValue1 * sign_[i1];
regionIndex2[numberNonZero++] = iBack1;
int otherRow1 = parent_[i1];
region[i1] = 0.0;
region[otherRow1] += pivotValue1;
i1 = otherRow1;
}
} else {
while (iDepth0 > iDepth1) {
double pivotValue = region[i0];
// put back now ?
int iBack = permuteBack_[i0];
double value = pivotValue * sign_[i0];
region2[numberNonZero] = value;
regionIndex2[numberNonZero++] = iBack;
if (iBack == pivotRow)
returnValue = value;
int otherRow = parent_[i0];
region[i0] = 0.0;
region[otherRow] += pivotValue;
iDepth0--;
i0 = otherRow;
}
while (i0 != i1) {
double pivotValue = region[i0];
// put back now ?
int iBack = permuteBack_[i0];
double value = pivotValue * sign_[i0];
region2[numberNonZero] = value;
regionIndex2[numberNonZero++] = iBack;
if (iBack == pivotRow)
returnValue = value;
int otherRow = parent_[i0];
region[i0] = 0.0;
region[otherRow] += pivotValue;
i0 = otherRow;
double pivotValue1 = region[i1];
// put back now ?
int iBack1 = permuteBack_[i1];
value = pivotValue1 * sign_[i1];
region2[numberNonZero] = value;
regionIndex2[numberNonZero++] = iBack1;
if (iBack1 == pivotRow)
returnValue = value;
int otherRow1 = parent_[i1];
region[i1] = 0.0;
region[otherRow1] += pivotValue1;
i1 = otherRow1;
}
}
} else {
// set up linked lists at each depth
// stack2 is start, stack is next
int greatestDepth = -1;
//mark_[numberRows_]=1;
for (i = 0; i < numberNonZero; i++) {
int j = regionIndex2[i];
double value = region2[i];
region2[i] = 0.0;
region[j] = value;
regionIndex[i] = j;
int iDepth = depth_[j];
if (iDepth > greatestDepth)
greatestDepth = iDepth;
// and back until marked
while (!mark_[j]) {
int iNext = stack2_[iDepth];
stack2_[iDepth] = j;
stack_[j] = iNext;
mark_[j] = 1;
iDepth--;
j = parent_[j];
}
}
numberNonZero = 0;
if (pivotRow < 0) {
for (; greatestDepth >= 0; greatestDepth--) {
int iPivot = stack2_[greatestDepth];
stack2_[greatestDepth] = -1;
while (iPivot >= 0) {
mark_[iPivot] = 0;
double pivotValue = region[iPivot];
if (pivotValue) {
// put back now ?
int iBack = permuteBack_[iPivot];
region2[numberNonZero] = pivotValue * sign_[iPivot];
regionIndex2[numberNonZero++] = iBack;
int otherRow = parent_[iPivot];
region[iPivot] = 0.0;
region[otherRow] += pivotValue;
}
iPivot = stack_[iPivot];
}
}
} else {
for (; greatestDepth >= 0; greatestDepth--) {
int iPivot = stack2_[greatestDepth];
stack2_[greatestDepth] = -1;
while (iPivot >= 0) {
mark_[iPivot] = 0;
double pivotValue = region[iPivot];
if (pivotValue) {
// put back now ?
int iBack = permuteBack_[iPivot];
double value = pivotValue * sign_[iPivot];
region2[numberNonZero] = value;
regionIndex2[numberNonZero++] = iBack;
if (iBack == pivotRow)
returnValue = value;
int otherRow = parent_[iPivot];
region[iPivot] = 0.0;
region[otherRow] += pivotValue;
}
iPivot = stack_[iPivot];
}
}
}
}
} else {
if (doTwo && region2[i0] * region2[i1] < 0.0) {
// If just +- 1 then could go backwards on depth until join
region[i0] = region2[i0];
region2[i0] = 0.0;
region[i1] = region2[i1];
region2[i1] = 0.0;
int iDepth0 = depth_[i0];
int iDepth1 = depth_[i1];
if (iDepth1 > iDepth0) {
int temp = i0;
i0 = i1;
i1 = temp;
temp = iDepth0;
iDepth0 = iDepth1;
iDepth1 = temp;
}
numberNonZero = 0;
while (iDepth0 > iDepth1) {
double pivotValue = region[i0];
// put back now ?
int iBack = permuteBack_[i0];
regionIndex2[numberNonZero++] = iBack;
int otherRow = parent_[i0];
region2[iBack] = pivotValue * sign_[i0];
region[i0] = 0.0;
region[otherRow] += pivotValue;
iDepth0--;
i0 = otherRow;
}
while (i0 != i1) {
double pivotValue = region[i0];
// put back now ?
int iBack = permuteBack_[i0];
regionIndex2[numberNonZero++] = iBack;
int otherRow = parent_[i0];
region2[iBack] = pivotValue * sign_[i0];
region[i0] = 0.0;
region[otherRow] += pivotValue;
i0 = otherRow;
double pivotValue1 = region[i1];
// put back now ?
int iBack1 = permuteBack_[i1];
regionIndex2[numberNonZero++] = iBack1;
int otherRow1 = parent_[i1];
region2[iBack1] = pivotValue1 * sign_[i1];
region[i1] = 0.0;
region[otherRow1] += pivotValue1;
i1 = otherRow1;
}
} else {
// set up linked lists at each depth
// stack2 is start, stack is next
int greatestDepth = -1;
//mark_[numberRows_]=1;
for (i = 0; i < numberNonZero; i++) {
int j = regionIndex2[i];
double value = region2[j];
region2[j] = 0.0;
region[j] = value;
regionIndex[i] = j;
int iDepth = depth_[j];
if (iDepth > greatestDepth)
greatestDepth = iDepth;
// and back until marked
while (!mark_[j]) {
int iNext = stack2_[iDepth];
stack2_[iDepth] = j;
stack_[j] = iNext;
mark_[j] = 1;
iDepth--;
j = parent_[j];
}
}
numberNonZero = 0;
for (; greatestDepth >= 0; greatestDepth--) {
int iPivot = stack2_[greatestDepth];
stack2_[greatestDepth] = -1;
while (iPivot >= 0) {
mark_[iPivot] = 0;
double pivotValue = region[iPivot];
if (pivotValue) {
// put back now ?
int iBack = permuteBack_[iPivot];
regionIndex2[numberNonZero++] = iBack;
int otherRow = parent_[iPivot];
region2[iBack] = pivotValue * sign_[iPivot];
region[iPivot] = 0.0;
region[otherRow] += pivotValue;
}
iPivot = stack_[iPivot];
}
}
}
if (pivotRow >= 0)
returnValue = region2[pivotRow];
}
region[numberRows_] = 0.0;
regionSparse2->setNumElements(numberNonZero);
#ifdef FULL_DEBUG
{
int i;
for (i = 0; i < numberRows_; i++) {
assert(!mark_[i]);
assert(stack2_[i] == -1);
}
}
#endif
return returnValue;
}
/* Updates one column (FTRAN) to/from array
** For large problems you should ALWAYS know where the nonzeros
are, so please try and migrate to previous method after you
have got code working using this simple method - thank you!
(the only exception is if you know input is dense e.g. rhs) */
int ClpNetworkBasis::updateColumn(CoinIndexedVector *regionSparse,
double region2[]) const
{
regionSparse->clear();
double *region = regionSparse->denseVector();
int numberNonZero = 0;
int *regionIndex = regionSparse->getIndices();
int i;
// set up linked lists at each depth
// stack2 is start, stack is next
int greatestDepth = -1;
for (i = 0; i < numberRows_; i++) {
double value = region2[i];
if (value) {
region2[i] = 0.0;
region[i] = value;
regionIndex[numberNonZero++] = i;
int j = i;
int iDepth = depth_[j];
if (iDepth > greatestDepth)
greatestDepth = iDepth;
// and back until marked
while (!mark_[j]) {
int iNext = stack2_[iDepth];
stack2_[iDepth] = j;
stack_[j] = iNext;
mark_[j] = 1;
iDepth--;
j = parent_[j];
}
}
}
numberNonZero = 0;
for (; greatestDepth >= 0; greatestDepth--) {
int iPivot = stack2_[greatestDepth];
stack2_[greatestDepth] = -1;
while (iPivot >= 0) {
mark_[iPivot] = 0;
double pivotValue = region[iPivot];
if (pivotValue) {
// put back now ?
int iBack = permuteBack_[iPivot];
numberNonZero++;
int otherRow = parent_[iPivot];
region2[iBack] = pivotValue * sign_[iPivot];
region[iPivot] = 0.0;
region[otherRow] += pivotValue;
}
iPivot = stack_[iPivot];
}
}
region[numberRows_] = 0.0;
return numberNonZero;
}
/* Updates one column transpose (BTRAN)
For large problems you should ALWAYS know where the nonzeros
are, so please try and migrate to previous method after you
have got code working using this simple method - thank you!
(the only exception is if you know input is dense e.g. dense objective)
returns number of nonzeros */
int ClpNetworkBasis::updateColumnTranspose(CoinIndexedVector *regionSparse,
double region2[]) const
{
// permute in after copying
// so will end up in right place
double *region = regionSparse->denseVector();
int *regionIndex = regionSparse->getIndices();
int i;
int numberNonZero = 0;
CoinMemcpyN(region2, numberRows_, region);
for (i = 0; i < numberRows_; i++) {
double value = region[i];
if (value) {
int k = permute_[i];
region[i] = 0.0;
region2[k] = value;
regionIndex[numberNonZero++] = k;
mark_[k] = 1;
}
}
// copy back
// set up linked lists at each depth
// stack2 is start, stack is next
int greatestDepth = -1;
int smallestDepth = numberRows_;
for (i = 0; i < numberNonZero; i++) {
int j = regionIndex[i];
// add in
int iDepth = depth_[j];
smallestDepth = CoinMin(iDepth, smallestDepth);
greatestDepth = CoinMax(iDepth, greatestDepth);
int jNext = stack2_[iDepth];
stack2_[iDepth] = j;
stack_[j] = jNext;
// and put all descendants on list
int iChild = descendant_[j];
while (iChild >= 0) {
if (!mark_[iChild]) {
regionIndex[numberNonZero++] = iChild;
mark_[iChild] = 1;
}
iChild = rightSibling_[iChild];
}
}
numberNonZero = 0;
region2[numberRows_] = 0.0;
int iDepth;
for (iDepth = smallestDepth; iDepth <= greatestDepth; iDepth++) {
int iPivot = stack2_[iDepth];
stack2_[iDepth] = -1;
while (iPivot >= 0) {
mark_[iPivot] = 0;
double pivotValue = region2[iPivot];
int otherRow = parent_[iPivot];
double otherValue = region2[otherRow];
pivotValue = sign_[iPivot] * pivotValue + otherValue;
region2[iPivot] = pivotValue;
if (pivotValue)
numberNonZero++;
iPivot = stack_[iPivot];
}
}
return numberNonZero;
}
/* Updates one column (BTRAN) from region2 */
int ClpNetworkBasis::updateColumnTranspose(CoinIndexedVector *regionSparse,
CoinIndexedVector *regionSparse2) const
{
// permute in - presume small number so copy back
// so will end up in right place
regionSparse->clear();
double *region = regionSparse->denseVector();
double *region2 = regionSparse2->denseVector();
int *regionIndex2 = regionSparse2->getIndices();
int numberNonZero2 = regionSparse2->getNumElements();
int *regionIndex = regionSparse->getIndices();
int i;
int numberNonZero = 0;
bool packed = regionSparse2->packedMode();
if (packed) {