Struct algorithms_edu::algo::graph::network_flow::NetworkFlowAdjacencyList

pub struct NetworkFlowAdjacencyList {
    pub source: usize,
    pub sink: usize,
    // some fields omitted
}

Fields

source: usize

sink: usize

Implementations

impl NetworkFlowAdjacencyList

pub fn ford_fulkerson(&mut self) -> i32

impl NetworkFlowAdjacencyList

pub fn with_size(n: usize) -> Self

Initialize an empty adjacency list that can hold up to n nodes.

pub fn and_source_sink(self, source: usize, sink: usize) -> Self

pub fn is_empty(&self) -> bool

pub fn add_edge(&mut self, from: usize, to: usize, capacity: i32)

pub fn add_edge_with_cost(
    &mut self,
    from: usize,
    to: usize,
    capacity: i32,
    cost: i32
)

pub fn from_edges(size: usize, edges: &[(usize, usize, i32)]) -> Self

pub fn from_edges_with_cost(
    size: usize,
    edges: &[(usize, usize, i32, i32)]
) -> Self

pub fn edges(&self) -> impl Iterator<Item = (usize, &Rc<RefCell<Edge>>)>

pub fn edge_count(&self) -> usize

pub fn nodes(&self) -> impl Iterator<Item = (usize, &Vec<Rc<RefCell<Edge>>>)>

pub fn node_count(&self) -> usize

Trait Implementations

impl Debug for NetworkFlowAdjacencyList

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

Formats the value using the given formatter.

impl Index<usize> for NetworkFlowAdjacencyList

type Output = Vec<Rc<RefCell<Edge>>>

The returned type after indexing.

pub fn index(&self, index: usize) -> &Self::Output

Performs the indexing (container[index]) operation.

impl IndexMut<usize> for NetworkFlowAdjacencyList

pub fn index_mut(&mut self, index: usize) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.