FA-12788 / Voting rule computation / Member archive

Locking a ranked pair closes an indirect preference cycle · case 03

Locking a ranked pair closes an indirect preference cycle.

Member previewVariant 3 · 3 implementations · 6 checks per implementation

Case contract

Given n candidates indexed 0..n-1 and unique directed victories already ordered by strength and a predetermined tie order, return locked edges in processing order. Reject any edge that would introduce a directed cycle. This models only the ranked-pairs locking stage.

Why this case matters

A deterministic toy ballot model makes the stated counting convention executable.

One recorded failure

Sample boundary fixture

This sample comes from the broken implementation of a controlled reproducer.

Boundary fixture	Actual	Expected	Outcome
long indirect cycle is rejected	`[[0, 1], [1, 2], [2, 3], [3, 4], [4, 5], [5, 0]]`	`[[0, 1], [1, 2], [2, 3], [3, 4], [4, 5]]`	Failed

MEMBER ARCHIVE

The complete case is available to members.

This record includes three runnable implementations, regression fixtures, execution results, and source hashes.

Member access is invitation-based. Sign in with your invited account to inspect the sources.