@@ -264,7 +264,6 @@ export default function blossom(CHECK_OPTIMUM, CHECK_DELTA) {
264
264
// connects a pair of S vertices. Label the new blossom as S; set its dual
265
265
// variable to zero; relabel its T-vertices to S and add them to the queue.
266
266
const addBlossom = ( base , k ) => {
267
- let i ;
268
267
let v = edges [ k ] [ 0 ] ;
269
268
let w = edges [ k ] [ 1 ] ;
270
269
const bb = inblossom [ base ] ;
@@ -381,7 +380,7 @@ export default function blossom(CHECK_OPTIMUM, CHECK_DELTA) {
381
380
382
381
blossombestedges [ b ] = [ ] ;
383
382
const length_2 = bestedgeto . length ;
384
- for ( i = 0 ; i < length_2 ; ++ i ) {
383
+ for ( let i = 0 ; i < length_2 ; ++ i ) {
385
384
k = bestedgeto [ i ] ;
386
385
if ( k !== - 1 ) blossombestedges [ b ] . push ( k ) ;
387
386
}
@@ -391,7 +390,7 @@ export default function blossom(CHECK_OPTIMUM, CHECK_DELTA) {
391
390
const length_3 = blossombestedges [ b ] . length ;
392
391
if ( length_3 > 0 ) {
393
392
bestedge [ b ] = blossombestedges [ b ] [ 0 ] ;
394
- for ( i = 1 ; i < length_3 ; ++ i ) {
393
+ for ( let i = 1 ; i < length_3 ; ++ i ) {
395
394
k = blossombestedges [ b ] [ i ] ;
396
395
if ( slack ( k ) < slack ( bestedge [ b ] ) ) {
397
396
bestedge [ b ] = k ;
@@ -408,19 +407,8 @@ export default function blossom(CHECK_OPTIMUM, CHECK_DELTA) {
408
407
'DEBUG: expandBlossom(' + b + ',' + endstage + ') ' + blossomchilds [ b ]
409
408
) ;
410
409
// Convert sub-blossoms into top-level blossoms.
411
- let i ;
412
- let j ;
413
- let s ;
414
- let p ;
415
- let entrychild ;
416
- let jstep ;
417
- let endptrick ;
418
- let bv ;
419
- let stop ;
420
- let base ;
421
-
422
- for ( i = 0 ; i < blossomchilds [ b ] . length ; ++ i ) {
423
- s = blossomchilds [ b ] [ i ] ;
410
+ for ( let i = 0 ; i < blossomchilds [ b ] . length ; ++ i ) {
411
+ const s = blossomchilds [ b ] [ i ] ;
424
412
425
413
blossomparent [ s ] = - 1 ;
426
414
if ( s < nvertex ) inblossom [ s ] = s ;
@@ -443,9 +431,13 @@ export default function blossom(CHECK_OPTIMUM, CHECK_DELTA) {
443
431
// Figure out through which sub-blossom the expanding blossom
444
432
// obtained its label initially.
445
433
assert ( labelend [ b ] >= 0 ) ;
446
- entrychild = inblossom [ endpoint [ labelend [ b ] ^ 1 ] ] ;
434
+ const entrychild = inblossom [ endpoint [ labelend [ b ] ^ 1 ] ] ;
447
435
// Decide in which direction we will go round the blossom.
448
- j = blossomchilds [ b ] . indexOf ( entrychild ) ;
436
+ let j = blossomchilds [ b ] . indexOf ( entrychild ) ;
437
+ let jstep ;
438
+ let endptrick ;
439
+ let stop ;
440
+ let base ;
449
441
if ( j & 1 ) {
450
442
// Start index is odd; go forward.
451
443
jstep = 1 ;
@@ -461,7 +453,7 @@ export default function blossom(CHECK_OPTIMUM, CHECK_DELTA) {
461
453
}
462
454
463
455
// Move along the blossom until we get to the base.
464
- p = labelend [ b ] ;
456
+ let p = labelend [ b ] ;
465
457
while ( j !== stop ) {
466
458
// Relabel the T-sub-blossom.
467
459
label [ endpoint [ p ^ 1 ] ] = 0 ;
@@ -478,7 +470,7 @@ export default function blossom(CHECK_OPTIMUM, CHECK_DELTA) {
478
470
479
471
// Relabel the base T-sub-blossom WITHOUT stepping through to
480
472
// its mate (so don't call assignLabel).
481
- bv = blossomchilds [ b ] [ 0 ] ;
473
+ let bv = blossomchilds [ b ] [ 0 ] ;
482
474
label [ endpoint [ p ^ 1 ] ] = 2 ;
483
475
label [ bv ] = 2 ;
484
476
labelend [ endpoint [ p ^ 1 ] ] = p ;
0 commit comments