Struct MinCostFlowGraph 

pub struct MinCostFlowGraph<T> { /* private fields */ }

Implementations

impl<T> MinCostFlowGraph<T>

where T: Integral + Neg<Output = T>,

pub fn new(n: usize) -> Self

pub fn get_edge(&self, i: usize) -> MinCostFlowEdge<T>

pub fn edges(&self) -> Vec<MinCostFlowEdge<T>>

pub fn add_edge(&mut self, from: usize, to: usize, cap: T, cost: T) -> usize

pub fn flow(&mut self, source: usize, sink: usize, flow_limit: T) -> (T, T)

Returns (maximum flow, cost)

pub fn slope( &mut self, source: usize, sink: usize, flow_limit: T, ) -> Vec<(T, T)>

Trait Implementations

impl<T: Clone> Clone for MinCostFlowGraph<T>

fn clone(&self) -> MinCostFlowGraph<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for MinCostFlowGraph<T>

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

Formats the value using the given formatter.