@@ -644,9 +644,7 @@ export default function blossom(CHECK_OPTIMUM, CHECK_DELTA) {
644
644
}
645
645
} ;
646
646
647
- let b ;
648
647
let d ;
649
- let v ;
650
648
let kslack ;
651
649
let base ;
652
650
let deltatype ;
@@ -696,7 +694,7 @@ export default function blossom(CHECK_OPTIMUM, CHECK_DELTA) {
696
694
// through an alternating path have got a label.
697
695
while ( queue . length && ! augmented ) {
698
696
// Take an S vertex from the queue.
699
- v = queue . pop ( ) ;
697
+ const v = queue . pop ( ) ;
700
698
console . debug ( 'DEBUG: POP v=' + v ) ;
701
699
assert ( label [ inblossom [ v ] ] === 1 ) ;
702
700
@@ -753,7 +751,7 @@ export default function blossom(CHECK_OPTIMUM, CHECK_DELTA) {
753
751
} else if ( label [ inblossom [ w ] ] === 1 ) {
754
752
// Keep track of the least-slack non-allowable edge to
755
753
// a different S-blossom.
756
- b = inblossom [ v ] ;
754
+ const b = inblossom [ v ] ;
757
755
if ( bestedge [ b ] === - 1 || kslack < slack ( bestedge [ b ] ) )
758
756
bestedge [ b ] = k ;
759
757
} else if ( label [ w ] === 0 ) {
@@ -859,7 +857,7 @@ export default function blossom(CHECK_OPTIMUM, CHECK_DELTA) {
859
857
}
860
858
861
859
// Update dual variables according to delta.
862
- for ( v = 0 ; v < nvertex ; ++ v ) {
860
+ for ( let v = 0 ; v < nvertex ; ++ v ) {
863
861
if ( label [ inblossom [ v ] ] === 1 ) {
864
862
// S-vertex: 2*u = 2*u - 2*delta
865
863
dualvar [ v ] -= delta ;
@@ -869,7 +867,7 @@ export default function blossom(CHECK_OPTIMUM, CHECK_DELTA) {
869
867
}
870
868
}
871
869
872
- for ( b = nvertex ; b < 2 * nvertex ; ++ b ) {
870
+ for ( let b = nvertex ; b < 2 * nvertex ; ++ b ) {
873
871
if ( blossombase [ b ] >= 0 && blossomparent [ b ] === - 1 ) {
874
872
if ( label [ b ] === 1 ) {
875
873
// Top-level S-blossom: z = z + 2*delta
@@ -917,7 +915,7 @@ export default function blossom(CHECK_OPTIMUM, CHECK_DELTA) {
917
915
if ( ! augmented ) break ;
918
916
919
917
// End of a stage; expand all S-blossoms which have dualvar = 0.
920
- for ( b = nvertex ; b < 2 * nvertex ; ++ b ) {
918
+ for ( let b = nvertex ; b < 2 * nvertex ; ++ b ) {
921
919
if (
922
920
blossomparent [ b ] === - 1 &&
923
921
blossombase [ b ] >= 0 &&
@@ -945,13 +943,13 @@ export default function blossom(CHECK_OPTIMUM, CHECK_DELTA) {
945
943
} ) ;
946
944
947
945
// Transform mate[] such that mate[v] is the vertex to which v is paired.
948
- for ( v = 0 ; v < nvertex ; ++ v ) {
946
+ for ( let v = 0 ; v < nvertex ; ++ v ) {
949
947
if ( mate [ v ] >= 0 ) {
950
948
mate [ v ] = endpoint [ mate [ v ] ] ;
951
949
}
952
950
}
953
951
954
- for ( v = 0 ; v < nvertex ; ++ v ) {
952
+ for ( let v = 0 ; v < nvertex ; ++ v ) {
955
953
assert ( mate [ v ] === - 1 || mate [ mate [ v ] ] === v ) ;
956
954
}
957
955
0 commit comments