Shortest paths

Canonical workflow

from reachq import WeightedDigraph
from reachq.hopset import build_hopset_for_sssp
from reachq.invariants import assert_distance_approximation

graph = WeightedDigraph()
graph.add_edge("a", "b", 1)
graph.add_edge("b", "c", 2)
graph.add_edge("a", "c", 10)

hopset, beta = build_hopset_for_sssp(
    graph, epsilon=0.1, random_seed=42, omega=3.0,
)
assert_distance_approximation(
    graph, hopset, source="a", epsilon=0.1, max_hops=20,
)

Interpret the result

epsilon is the allowed multiplicative approximation budget used by the invariant check. beta is a construction quantity, not a wall-clock speedup. The current hopset construction is sequential Python code.

Use benchmarking guidance to record exact and bounded-hop query times separately.