petgraph/algo/maximum_flow/mod.rs
1//! Collection of algorithms for the [Maximum Flow Problem][max_flow].
2//!
3//! Both algorithms solve the maximum flow problem and compute the same
4//! maximum flow value, although they may differ in how much flow is
5//! assigned to each edge in the resulting flow.
6//!
7//! [dinics] and [ford_fulkerson] have different time complexities, and
8//! their performance can vary significantly depending on the input graph.
9//! In general, [dinics] is faster, especially on dense graphs, graphs with
10//! unit capacities, and bipartite graphs.
11//! [ford_fulkerson] may be a better choice when working with small or
12//! sparse graphs.
13//!
14//! For more information about each algorithm and their detailed time
15//! complexity, check their respective documentation.
16//!
17//! [max_flow]: https://en.wikipedia.org/wiki/Maximum_flow_problem
18
19mod dinics;
20mod ford_fulkerson;
21
22pub use dinics::dinics;
23pub use ford_fulkerson::ford_fulkerson;