pub struct Solution {
pub routes: Vec<Vec<usize>>,
pub lengths: Vec<f64>,
pub total: f64,
pub lower_bound: f64,
pub best_iteration: usize,
}Expand description
A routing solution.
Fields§
§routes: Vec<Vec<usize>>The routes, each a sequence of unit indices (depot excluded).
lengths: Vec<f64>Travel cost of each route, depot to depot.
total: f64Total travel cost.
lower_bound: f64A lower bound on the total cost of any solution visiting the same units with one route (half the sum of the two cheapest edges at each node, depot included).
best_iteration: usizeIteration at which the best solution was found.
Implementations§
Trait Implementations§
Auto Trait Implementations§
impl Freeze for Solution
impl RefUnwindSafe for Solution
impl Send for Solution
impl Sync for Solution
impl Unpin for Solution
impl UnsafeUnpin for Solution
impl UnwindSafe for Solution
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more