FA-11698 / Graph algorithm invariants / Member archive

Parallel edges are all removed when testing a single bridge · case 03

Parallel edges are all removed when testing a single bridge.

Member previewVariant 3 · 3 implementations · 8 checks per implementation

Case contract

Return input indices of bridges in an undirected multigraph. Self loops and parallel edges are allowed. Removing exactly one bridge increases the number of connected components.

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
parallel pair	`[0, 1]`	`[]`	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.