protected function makeStrongestPaths () : void
    {
        foreach ($this->_selfElection->getCandidatesList() as $i => $i_value) :
            foreach ($this->_selfElection->getCandidatesList() as $j => $j_value) :
                if ($i !== $j) :
                    if ( $this->_selfElection->getPairwise(false)[$i]['win'][$j] > $this->_selfElection->getPairwise(false)[$j]['win'][$i] ) :
                        $this->_StrongestPaths[$i][$j] = $this->schulzeVariant($i,$j);                      
                    else :
                        $this->_StrongestPaths[$i][$j] = 0;
                    endif;
                endif;
            endforeach;
        endforeach;

        foreach ($this->_selfElection->getCandidatesList() as $i => $i_value) :
            foreach ($this->_selfElection->getCandidatesList() as $j => $j_value) :
                if ($i !== $j) :
                    foreach ($this->_selfElection->getCandidatesList() as $k => $k_value) :
                        if ($i !== $k && $j !== $k) :
                            $this->_StrongestPaths[$j][$k] = 
                                max( $this->_StrongestPaths[$j][$k], 
                                     min($this->_StrongestPaths[$j][$i], $this->_StrongestPaths[$i][$k]) );
                        endif;
                    endforeach;
                endif;
            endforeach;
        endforeach;
    }
protected function makeStrongestPaths () : void
    {
        foreach ($this->_selfElection->getCandidatesList() as $i => $i_value) :
            foreach ($this->_selfElection->getCandidatesList() as $j => $j_value) :
                if ($i !== $j) :
                    if ( $this->_selfElection->getPairwise(false)[$i]['win'][$j] > $this->_selfElection->getPairwise(false)[$j]['win'][$i] ) :
                        $this->_StrongestPaths[$i][$j] = $this->schulzeVariant($i,$j);                      
                    else :
                        $this->_StrongestPaths[$i][$j] = 0;
                    endif;
                endif;
            endforeach;
        endforeach;

        foreach ($this->_selfElection->getCandidatesList() as $i => $i_value) :
            foreach ($this->_selfElection->getCandidatesList() as $j => $j_value) :
                if ($i !== $j) :
                    foreach ($this->_selfElection->getCandidatesList() as $k => $k_value) :
                        if ($i !== $k && $j !== $k) :
                            $this->_StrongestPaths[$j][$k] = 
                                max( $this->_StrongestPaths[$j][$k], 
                                     min($this->_StrongestPaths[$j][$i], $this->_StrongestPaths[$i][$k]) );
                        endif;
                    endforeach;
                endif;
            endforeach;
        endforeach;
    }
protected function makeStrongestPaths ( ) : void { foreach ( $ this -> _selfElection -> getCandidatesList ( ) as $ i => $ i_value ) : foreach ( $ this -> _selfElection -> getCandidatesList ( ) as $ j => $ j_value ) : if ( $ i !== $ j ) : if ( $ this -> _selfElection -> getPairwise ( false ) [ $ i ] [ 'win' ] [ $ j ] > $ this -> _selfElection -> getPairwise ( false ) [ $ j ] [ 'win' ] [ $ i ] ) : $ this -> _StrongestPaths [ $ i ] [ $ j ] = $ this -> schulzeVariant ( $ i , $ j ) ; else : $ this -> _StrongestPaths [ $ i ] [ $ j ] = 0 ; endif ; endif ; endforeach ; endforeach ; foreach ( $ this -> _selfElection -> getCandidatesList ( ) as $ i => $ i_value ) : foreach ( $ this -> _selfElection -> getCandidatesList ( ) as $ j => $ j_value ) : if ( $ i !== $ j ) : foreach ( $ this -> _selfElection -> getCandidatesList ( ) as $ k => $ k_value ) : if ( $ i !== $ k && $ j !== $ k ) : $ this -> _StrongestPaths [ $ j ] [ $ k ] = max ( $ this -> _StrongestPaths [ $ j ] [ $ k ] , min ( $ this -> _StrongestPaths [ $ j ] [ $ i ] , $ this -> _StrongestPaths [ $ i ] [ $ k ] ) ) ; endif ; endforeach ; endif ; endforeach ; endforeach ; }
Calculate the Strongest Paths
Calculate the Strongest Paths