urna_runtime/graph/mod.rs
1//! chunk-to-chunk graph runtime (G1). mirrors `ann`: a flat csr is parsed
2//! off the graph_adjacency (0x0C) section at open time and walked with zero
3//! allocation. `bounded_bfs` GENERATES candidate chunk ordinals seeded from
4//! the exact-cosine top-k; the candidates are handed to the SAME mandatory
5//! exact rerank (`score_subset`) so a graph edge can never leak into a
6//! returned score. recall stays `f32::NAN` (we never lie).
7
8mod csr;
9mod traverse;
10
11pub use csr::CsrIndex;
12pub use traverse::Traversal;