rs_graph/
mcf.rs

1/*
2 * Copyright (c) 2021, 2022 Frank Fischer <frank-fischer@shadow-soft.de>
3 *
4 * This program is free software: you can redistribute it and/or
5 * modify it under the terms of the GNU General Public License as
6 * published by the Free Software Foundation, either version 3 of the
7 * License, or (at your option) any later version.
8 *
9 * This program is distributed in the hope that it will be useful, but
10 * WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
12 * General Public License for more details.
13 *
14 * You should have received a copy of the GNU General Public License
15 * along with this program.  If not, see  <http://www.gnu.org/licenses/>
16 */
17
18//! Minimum Cost Flow algorithms.
19
20pub mod simplex;
21pub use simplex::{network_simplex, NetworkSimplex};
22
23#[derive(Clone, Copy, PartialEq, Eq, Debug)]
24pub enum SolutionState {
25    /// Unknown state, the problem has not been solved, yet
26    Unknown,
27    /// The problem has been solved to optimality
28    Optimal,
29    /// The problem is infeasible
30    Infeasible,
31    /// The problem is unbounded
32    Unbounded,
33}
rs_graph/mcf.rs

rs_graph/
mcf.rs
