FA-11718 / Graph algorithm invariants / Member archive

Matching freezes an early choice instead of following an augmenting path · case 03

Matching freezes an early choice instead of following an augmenting path.

Member previewVariant 3 · 3 implementations · 8 checks per implementation

Case contract

Return maximum matching cardinality for the given ordered distinct left vertices and bipartite edges (left label, right label). The two sides are separate namespaces; repeated edges count once.

Why this case matters

A deterministic in-memory graph model isolates this invariant; no large-graph performance or production graph engine behavior is claimed.

One recorded failure

Sample boundary fixture

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

Boundary fixture	Actual	Expected	Outcome
displace first match	`1`	`2`	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.