FA-11740 / Graph algorithm invariants / Member archive
Triangle counting includes closed walks through self loops · case 05
Triangle counting includes closed walks through self loops.
Case contract
Return the number of distinct three-vertex cliques in an undirected graph. Self loops are ignored and parallel declarations 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 fixtureThis sample comes from the broken implementation of a controlled reproducer.
| Boundary fixture | Actual | Expected | Outcome |
|---|---|---|---|
| loops on adjacent vertices are not triangles | 1 | 0 | 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.
Sign in to the archive ↗