Enum SolverPath

Source

pub enum SolverPath {
    Eliminate {
        width: usize,
    },
    BranchAndBound {
        width: usize,
    },
    Monic,
    Iso,
}

Expand description

Which algorithm a component of the network was routed to.

The four paths are exhaustive. Injectivity is not a property of a network, so the two injective paths are chosen by which entry point the caller calls; everything else goes through solve, which routes on the induced width against the budget.

Variants§

§

Eliminate

Exact bucket elimination in the (min, ⊕) semiring.

Chosen when the width is small enough that the message tables fit the budget. It never prunes, never consults a node budget, and always proves optimality.

Fields

§width: usize

The induced width of the elimination order actually used.

§

BranchAndBound

Depth-first branch and bound with soft local consistency maintained at every node.

The fallback when elimination would not fit. It carries a node budget and can be interrupted, which is what the anytime contract is for.

Fields

§width: usize

The induced width of the elimination order actually used, which drives the variable ordering rather than an allocation.

§

Monic

The injective path: branch and bound with an all-different constraint.

Injectivity completes the primal graph, so elimination is out by construction rather than by budget. Reported by solve_monic.

§

Iso

The maximum common induced sub-schema path.

Injective and edge-reflecting, which is a strictly stronger demand than Self::Monic and a different algorithm. Reported by solve_iso.

SolverPath

Enum SolverPath Copy item path

Variants§

Eliminate

Fields

BranchAndBound

Fields

Monic

Iso

Trait Implementations§

impl Clone for SolverPath

fn clone(&self) -> SolverPath

fn clone_from(&mut self, source: &Self)

impl Copy for SolverPath

impl Debug for SolverPath

fn fmt(&self, f: &mut Formatter<'_>) -> Result

impl Eq for SolverPath

impl Hash for SolverPath

fn hash<__H: Hasher>(&self, state: &mut __H)

fn hash_slice<H>(data: &[Self], state: &mut H)where H: Hasher, Self: Sized,

impl PartialEq for SolverPath

fn eq(&self, other: &SolverPath) -> bool

fn ne(&self, other: &Rhs) -> bool

impl StructuralPartialEq for SolverPath

Auto Trait Implementations§

impl Freeze for SolverPath

impl RefUnwindSafe for SolverPath

impl Send for SolverPath

impl Sync for SolverPath

impl Unpin for SolverPath

impl UnsafeUnpin for SolverPath

impl UnwindSafe for SolverPath

Blanket Implementations§

impl<T> Any for Twhere T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for Twhere T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for Twhere T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> CloneToUninit for Twhere T: Clone,

unsafe fn clone_to_uninit(&self, dest: *mut u8)

impl<T> From<T> for T

fn from(t: T) -> T

impl<T, U> Into<U> for Twhere U: From<T>,

fn into(self) -> U

impl<D> OwoColorize for D

fn fg<C>(&self) -> FgColorDisplay<'_, C, Self>where C: Color,

fn bg<C>(&self) -> BgColorDisplay<'_, C, Self>where C: Color,

fn black(&self) -> FgColorDisplay<'_, Black, Self>

fn on_black(&self) -> BgColorDisplay<'_, Black, Self>

fn red(&self) -> FgColorDisplay<'_, Red, Self>

fn on_red(&self) -> BgColorDisplay<'_, Red, Self>

fn green(&self) -> FgColorDisplay<'_, Green, Self>

fn on_green(&self) -> BgColorDisplay<'_, Green, Self>

fn yellow(&self) -> FgColorDisplay<'_, Yellow, Self>

fn on_yellow(&self) -> BgColorDisplay<'_, Yellow, Self>

fn blue(&self) -> FgColorDisplay<'_, Blue, Self>

fn on_blue(&self) -> BgColorDisplay<'_, Blue, Self>

fn magenta(&self) -> FgColorDisplay<'_, Magenta, Self>

fn on_magenta(&self) -> BgColorDisplay<'_, Magenta, Self>

fn purple(&self) -> FgColorDisplay<'_, Magenta, Self>

fn on_purple(&self) -> BgColorDisplay<'_, Magenta, Self>

fn cyan(&self) -> FgColorDisplay<'_, Cyan, Self>

fn on_cyan(&self) -> BgColorDisplay<'_, Cyan, Self>

fn white(&self) -> FgColorDisplay<'_, White, Self>

fn on_white(&self) -> BgColorDisplay<'_, White, Self>

fn default_color(&self) -> FgColorDisplay<'_, Default, Self>

fn on_default_color(&self) -> BgColorDisplay<'_, Default, Self>

fn bright_black(&self) -> FgColorDisplay<'_, BrightBlack, Self>

fn on_bright_black(&self) -> BgColorDisplay<'_, BrightBlack, Self>

fn bright_red(&self) -> FgColorDisplay<'_, BrightRed, Self>

fn on_bright_red(&self) -> BgColorDisplay<'_, BrightRed, Self>

fn bright_green(&self) -> FgColorDisplay<'_, BrightGreen, Self>

fn on_bright_green(&self) -> BgColorDisplay<'_, BrightGreen, Self>

fn bright_yellow(&self) -> FgColorDisplay<'_, BrightYellow, Self>

fn on_bright_yellow(&self) -> BgColorDisplay<'_, BrightYellow, Self>

fn bright_blue(&self) -> FgColorDisplay<'_, BrightBlue, Self>

fn on_bright_blue(&self) -> BgColorDisplay<'_, BrightBlue, Self>

fn bright_magenta(&self) -> FgColorDisplay<'_, BrightMagenta, Self>

fn on_bright_magenta(&self) -> BgColorDisplay<'_, BrightMagenta, Self>

Enum SolverPath

fn hash<H: Hasher>(&self, state: &mut H)

fn hash_slice<H>(data: &[Self], state: &mut H)
where H: Hasher, Self: Sized,

impl<T> Any for T
where T: 'static + ?Sized,

impl<T> Borrow<T> for T
where T: ?Sized,

impl<T> BorrowMut<T> for T
where T: ?Sized,

impl<T> CloneToUninit for T
where T: Clone,

impl<T, U> Into<U> for T
where U: From<T>,

fn fg<C>(&self) -> FgColorDisplay<'_, C, Self>
where C: Color,

fn bg<C>(&self) -> BgColorDisplay<'_, C, Self>
where C: Color,

fn color<Color>(&self, color: Color) -> FgDynColorDisplay<'_, Color, Self>
where Color: DynColor,

fn on_color<Color>(&self, color: Color) -> BgDynColorDisplay<'_, Color, Self>
where Color: DynColor,

impl<T> ToOwned for T
where T: Clone,

impl<T, U> TryFrom<U> for T
where U: Into<T>,

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,