Struct LagrangianRoute

Source

pub struct LagrangianRoute {
    pub path: Vec<usize>,
    pub edges: Vec<usize>,
    pub cost: f64,
    pub resource: f64,
    pub lower_bound: f64,
    pub lambda: f64,
    pub iterations: usize,
}

Expand description

Outcome of the Lagrangian constrained-shortest-path solver: a feasible path, its true cost/resource, the best dual lower bound on the optimal cost (cost == lower_bound proves optimality), the multiplier that produced it and the number of Dijkstra runs spent.

Fields§

§path: Vec<usize>§edges: Vec<usize>§cost: f64§resource: f64§lower_bound: f64§lambda: f64§iterations: usize

Auto Trait Implementations§

§

LagrangianRoute

Struct LagrangianRoute Copy item path

Fields§

Auto Trait Implementations§

impl Freeze for LagrangianRoute

impl RefUnwindSafe for LagrangianRoute

impl Send for LagrangianRoute

impl Sync for LagrangianRoute

impl Unpin for LagrangianRoute

impl UnsafeUnpin for LagrangianRoute

impl UnwindSafe for LagrangianRoute

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> From<T> for T

fn from(t: T) -> T

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

fn into(self) -> U

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

type Error = Infallible

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

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

type Error = <U as TryFrom<T>>::Error

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Struct LagrangianRoute

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, U> Into<U> for T
where U: From<T>,

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

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