Measured bounded run
Dependency DAG Walk
Hypothesis
Topological traversal visits a 10,000-node synthetic chain without a cycle.
Protocol and result
{
"protocol": {
"command": "node scripts/run-experiments.mjs",
"repetitions": 3,
"input": "deterministic synthetic generator"
},
"environment": {
"node": "v24.14.1",
"platform": "win32",
"arch": "x64"
},
"repetitions": 3,
"metrics": {
"processed": 10000,
"visited": 10000,
"cycle": false
},
"average_ms": 1.877,
"raw_output_sha256": "202620652910ebebeb8960f1ff1047dc8313340ffb0bde5fa7eac5b2c618eef5",
"stable": true,
"status": "PASS"
}Limitations
One sparse graph shape; not a graph-library comparison.