Struct Traversal 

pub struct Traversal { /* private fields */ }

reusable traversal scratch. allocate once per CsrIndex, reuse across queries; bounded_bfs bumps the generation so stale stamps read as unvisited without clearing the buffer.

Implementations

impl Traversal

pub fn new(n_nodes: usize) -> Self

pub fn bounded_bfs( &mut self, csr: &CsrIndex, seeds: &[usize], hops: usize, max_frontier: usize, ) -> Vec<usize>

bounded bfs from seeds, expanding up to hops levels of the csr and capping the total returned candidate count at max_frontier. returns a deduped Vec<usize> of chunk ordinals (seeds first, in arrival order). pure integer, no scoring.