solvr 0.2.0

Advanced computing library for real-world problem solving - optimization, differential equations, interpolation, statistics, and more
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34

//! Network flow algorithm traits.
use crate::DType;

use numr::error::Result;
use numr::runtime::Runtime;

use super::types::{FlowResult, GraphData, MinCostFlowOptions};

/// Network flow algorithms.
///
/// Computes maximum flow and minimum cost flow in directed graphs.
pub trait FlowAlgorithms<R: Runtime<DType = DType>> {
    /// Maximum flow via Edmonds-Karp (BFS-based Ford-Fulkerson).
    ///
    /// Sequential (BFS augmenting paths).
    ///
    /// # Complexity
    /// O(V * E^2).
    fn max_flow(&self, graph: &GraphData<R>, source: usize, sink: usize) -> Result<FlowResult<R>>;

    /// Minimum cost maximum flow.
    ///
    /// Sequential (successive shortest path algorithm).
    ///
    /// # Complexity
    /// O(V * E * max_flow).
    fn min_cost_flow(
        &self,
        graph: &GraphData<R>,
        source: usize,
        sink: usize,
        options: &MinCostFlowOptions,
    ) -> Result<FlowResult<R>>;
}