FA-11734 / Graph algorithm invariants / Member archive

Articulation detection compares against one component in a disconnected graph · case 04

Articulation detection compares against one component in a disconnected graph.

Member previewVariant 4 · 3 implementations · 8 checks per implementation

Case contract

Return sorted articulation vertices of an undirected loopless graph. A vertex qualifies only when its deletion and deletion of its incident edges increases the total connected-component count.

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
two disjoint edges plus isolate	`[40, 41, 42, 43, 44]`	`[]`	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.