FA-11692 / Graph algorithm invariants / Member archive

Strong components collapse one-way reachability into equivalence · case 02

Strong components collapse one-way reachability into equivalence.

Member previewVariant 2 · 3 implementations · 8 checks per implementation

Case contract

For distinct integer vertices and directed edges among them, return strongly connected components, members sorted and components ordered by smallest member; isolated vertices are singleton 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
one way link	`[[20, 21]]`	`[[20], [21]]`	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.