Index: trunk/extensions/SecurePoll/includes/Tallier.php |
— | — | @@ -464,18 +464,16 @@ |
465 | 465 | } |
466 | 466 | $v12 = $victories[$oid1][$oid2]; |
467 | 467 | $v21 = $victories[$oid2][$oid1]; |
468 | | - #if ( $v12 > $v21 ) { |
| 468 | + if ( $v12 > $v21 ) { |
469 | 469 | # Direct victory |
470 | 470 | $strengths[$oid1][$oid2] = array( $v12, $v21 ); |
471 | | - #} else { |
| 471 | + } else { |
472 | 472 | # Direct loss |
473 | | - # $strengths[$oid1][$oid2] = array( 0, 0 ); |
474 | | - #} |
| 473 | + $strengths[$oid1][$oid2] = array( 0, 0 ); |
| 474 | + } |
475 | 475 | } |
476 | 476 | } |
477 | 477 | |
478 | | - echo $this->convertMatrixToText( $strengths, $this->optionIds ) . "\n"; |
479 | | - |
480 | 478 | # Next (continuing the Floyd-Warshall algorithm) we calculate the strongest indirect |
481 | 479 | # paths. This part dominates the O(N^3) time order. |
482 | 480 | foreach ( $this->optionIds as $oid1 ) { |