/* Exhaustive search phase using branch-and-bound.
Exhaustive search explores the entire solution space systematically,
using pruning to avoid exploring branches that cannot improve on the
best solution found so far.
# Exploration Types
- **Depth First**: Explores deepest nodes first (memory efficient)
- **Breadth First**: Explores level by level (finds shortest paths)
- **Score First**: Explores best-scoring nodes first (greedy)
- **Optimistic Bound First**: Explores most promising bounds first (A*)
*/
pub use ;
pub use ExhaustiveSearchConfig;
pub use ;
pub use ExplorationType;
pub use ;
pub use ExhaustiveSearchPhase;