[−][src]Struct algorithms_edu::algo::graph::network_flow::Edge
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
[src]
pub fn new(from: usize, to: usize, capacity: i32) -> [Rc<RefCell<Self>>; 2]
[src]
pub fn new_with_cost(
from: usize,
to: usize,
capacity: i32,
cost: i32
) -> [Rc<RefCell<Self>>; 2]
[src]
from: usize,
to: usize,
capacity: i32,
cost: i32
) -> [Rc<RefCell<Self>>; 2]
pub fn is_residual(&self) -> bool
[src]
pub fn reamaining_capacity(&self) -> i32
[src]
pub fn augment(&mut self, bottleneck: i32)
[src]
Trait Implementations
Auto Trait Implementations
impl !RefUnwindSafe for Edge
[src]
impl !Send for Edge
[src]
impl !Sync for Edge
[src]
impl Unpin for Edge
[src]
impl !UnwindSafe for Edge
[src]
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
pub fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
V: MultiLane<T>,