Struct algorithms_edu::algo::graph::network_flow::Edge

pub struct Edge {
    pub from: usize,
    pub to: usize,
    pub flow: i32,
    pub capacity: i32,
    pub residual: Weak<RefCell<Edge>>,
    pub cost: i32,
    pub original_cost: i32,
}

This edge type is designed specifically for networkflow graphs.

Fields

from: usize

to: usize

flow: i32

capacity: i32

residual: Weak<RefCell<Edge>>

a weak reference to the residual edge that's pointing in the opposite direction

cost: i32

original_cost: i32

Implementations

impl Edge

pub fn new(from: usize, to: usize, capacity: i32) -> [Rc<RefCell<Self>>; 2]

pub fn new_with_cost(
    from: usize,
    to: usize,
    capacity: i32,
    cost: i32
) -> [Rc<RefCell<Self>>; 2]

pub fn is_residual(&self) -> bool

pub fn reamaining_capacity(&self) -> i32

pub fn augment(&mut self, bottleneck: i32)

Trait Implementations

impl Clone for Edge

pub fn clone(&self) -> Edge

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Edge

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

Formats the value using the given formatter.