Module traversal 

Graph traversal algorithms on the CSR index.

BFS, bidirectional shortest path, and subgraph materialization. All algorithms respect a max-visited cap to prevent supernode fan-out explosion from consuming unbounded memory.

Access tracking and prefetch hints are integrated: each traversal records node access for hot/cold partition decisions, and prefetches frontier neighbors for cache efficiency.

Constants

DEFAULT_MAX_VISITED

Default cap on visited nodes during BFS traversals. Prevents supernode fan-out explosion from consuming unbounded memory.