pub struct MinCostFlowResult {
pub max_flow: f64,
pub total_cost: f64,
pub flow_edges: Vec<(NodeId, NodeId, f64, f64)>,
}Expand description
Result of min cost max flow algorithm.
Fields§
§max_flow: f64Maximum flow value.
total_cost: f64Total cost of the flow.
flow_edges: Vec<(NodeId, NodeId, f64, f64)>Flow on each edge: (source, target, flow, cost)
Trait Implementations§
Source§impl Clone for MinCostFlowResult
impl Clone for MinCostFlowResult
Source§fn clone(&self) -> MinCostFlowResult
fn clone(&self) -> MinCostFlowResult
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreAuto Trait Implementations§
impl Freeze for MinCostFlowResult
impl RefUnwindSafe for MinCostFlowResult
impl Send for MinCostFlowResult
impl Sync for MinCostFlowResult
impl Unpin for MinCostFlowResult
impl UnwindSafe for MinCostFlowResult
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