votes
    Preparing search index...

    Class RankedPairs<C>

    By default, equal-strength pairs are locked simultaneously: if they would form a cycle among themselves, none are locked (most neutral outcome).

    Pass edgeSorter to process equal-strength pairs sequentially instead — the sorter determines which pairs are locked first. byTotalParticipation (exported from this module) is a ready-made sorter that prefers pairs where more voters expressed a preference. Sequential processing matches the canonical Tideman algorithm but makes the result order-dependent when the sorter cannot distinguish all tied pairs.

    The Edge type passed to the sorter has { from, to, value, total }.

    Type Parameters

    • C extends string

    Hierarchy

    • MatrixScoreMethod<C>
      • RankedPairs
    Index

    Constructors

    constructor

    Properties

    candidates isRandom needsBallot needsMatrix

    Accessors

    matrix

    Methods

    canonicalRanking deTie ranking restrict restrictRanking scores

    Constructors

    Properties

    candidates: C[]
    isRandom: boolean = false
    needsBallot: boolean = false
    needsMatrix: true

    Accessors

    Methods

    • Returns C[][]

    • Result of the vote. The first item lists the winners of the vote.

      For example this ranking means that Bear wins, Sheep is second and Lion third [ [ 'Bear' ], [ 'Sheep' ], [ 'Lion' ] ]

      Returns C[][]

    • Type Parameters

      • D extends string

      Parameters

      • candidates: D[]

      Returns D[][]

    Settings

    Member Visibility

    On This Page

    Wikipedia: Ranked pairs
    Constructors
    Properties
    Accessors
    Methods