Graph algorithms, full paths, and the work a benchmark must count A full-path graph algorithm benchmark over 2.147 billion path entries: an explicit output contract, three rounds of optimization, two regressions and one correctness bug.