//! Graph analysis algorithms.
//!
//! This module currently provides classic control-flow analyses:
//! - dominators
//! - post-dominators
//! - canonical edge-based SESE regions / program-structure trees
//!
//! Re-exported helpers:
//! - [`reachable_from_root`]
//! - [`compute_dominators`]
//! - [`DominatorTree`]
//! - [`compute_postdominators`]
//! - [`compute_sese`]
pub use ;
pub use compute_postdominators;
// Public rather than crate-private: the layout crate composes SESE regions from
// the candidate set before `compute_sese` reduces it to the canonical tree.
pub use compute_sese_candidates;
pub use ;