//! Graph traversal and analysis operations over CSR-encoded directed graphs.
//!
//! Graph ops are Category A compositions. BFS and DFS assume
//! valid CSR adjacency structures and bounded queue sizes.
dir!;
/// Compile-time maximum BFS queue slots.
pub use MAX_BFS_QUEUE;
// Canonical graph limits live in `crate::ir::validate::limits`.
/// Maximum DFA states, graph edges, and graph nodes enforced by the IR validator.
pub use crate;