Documentation
¶
Overview ¶
Package dimacs9 implements the harness that drives GoGraph against the DIMACS 9th Implementation Challenge shortest-paths workload.
The official DIMACS datasets (.gr/.co files) are external; the harness in v1 ingests a synthetic road-network-shaped graph generated by Synthetic for reproducible CI runs. The query loop runs Dijkstra from a sequence of seed vertices and records per-call latency.
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
func Synthetic ¶
Synthetic builds a directed weighted adjacency list approximating a road network: every vertex points to its two next-numbered neighbours and one random shortcut, with int64 edge weights derived deterministically from the endpoint indices. Returns the partially-built adjlist on any adjlist.AdjList error so callers can observe how far ingestion progressed before failure.
Types ¶
type Report ¶
Report is the result of a benchmark run.