pub enum Solution {
Optimal {
flow: Vec<i64>,
potential: Vec<i128>,
cost: i128,
},
Infeasible {
cut: Vec<usize>,
},
Unbounded {
cycle: Vec<usize>,
},
}Expand description
A problem’s answer, with its certificate.
Variants§
Optimal
Infeasible
Nodes whose supply is more than the arcs leaving them can carry.
Unbounded
No optimum: uncapacitated arcs, in order, around a cycle of negative cost, around which any flow meeting the supplies gets cheaper without end.
Trait Implementations§
impl Eq for Solution
impl StructuralPartialEq for Solution
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