protected function prepareStrongestPath () : void
    {
        $this->_StrongestPaths = [];

        foreach ( $this->_selfElection->getCandidatesList() as $candidate_key => $candidate_id ) :
            $this->_StrongestPaths[$candidate_key] = [];

            // Format array for the strongest path
            foreach ( $this->_selfElection->getCandidatesList() as $candidate_key_r => $candidate_id_r ) :
                if ($candidate_key_r != $candidate_key) :
                    $this->_StrongestPaths[$candidate_key][$candidate_key_r] = 0;
                endif;
            endforeach;
        endforeach;
    }
protected function prepareStrongestPath () : void
    {
        $this->_StrongestPaths = [];

        foreach ( $this->_selfElection->getCandidatesList() as $candidate_key => $candidate_id ) :
            $this->_StrongestPaths[$candidate_key] = [];

            // Format array for the strongest path
            foreach ( $this->_selfElection->getCandidatesList() as $candidate_key_r => $candidate_id_r ) :
                if ($candidate_key_r != $candidate_key) :
                    $this->_StrongestPaths[$candidate_key][$candidate_key_r] = 0;
                endif;
            endforeach;
        endforeach;
    }
protected function prepareStrongestPath ( ) : void { $ this -> _StrongestPaths = [ ] ; foreach ( $ this -> _selfElection -> getCandidatesList ( ) as $ candidate_key => $ candidate_id ) : $ this -> _StrongestPaths [ $ candidate_key ] = [ ] ; // Format array for the strongest path foreach ( $ this -> _selfElection -> getCandidatesList ( ) as $ candidate_key_r => $ candidate_id_r ) : if ( $ candidate_key_r != $ candidate_key ) : $ this -> _StrongestPaths [ $ candidate_key ] [ $ candidate_key_r ] = 0 ; endif ; endforeach ; endforeach ; }
Calculate the strongest Paths for Schulze Method
Calculate the strongest Paths for Schulze Method