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
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
use {EdgeSlice, EdgeVec, Graph, IndexGraph, IndexNetwork};
use num::traits::{Num, NumAssign};
pub trait MaxFlow<'a> {
type Graph: IndexGraph<'a>;
type Flow: Num + Ord;
fn new(g: &'a Self::Graph) -> Self;
fn as_graph(&self) -> &'a Self::Graph;
fn value(&self) -> Self::Flow;
fn flow(&self, a: <Self::Graph as Graph<'a>>::Edge) -> Self::Flow;
fn flow_vec(&self) -> EdgeVec<'a, Self::Graph, Self::Flow> {
let g = self.as_graph();
edgevec![g, g.edges().map(|e| self.flow(e)).collect()]
}
fn solve<'b>(
&mut self,
src: <Self::Graph as Graph<'a>>::Node,
snk: <Self::Graph as Graph<'a>>::Node,
upper: &EdgeSlice<'a, 'b, Self::Graph, Self::Flow>,
);
fn mincut(&self) -> Vec<<Self::Graph as Graph<'a>>::Node>;
}
pub fn solve<'a, 'b, G, F, M>(
g: &'a G,
src: G::Node,
snk: G::Node,
upper: &EdgeSlice<'a, 'b, G, F>,
) -> (F, EdgeVec<'a, G, F>, Vec<G::Node>)
where
G: IndexGraph<'a>,
F: Num + Ord + Copy,
M: MaxFlow<'a, Graph = G, Flow = F>,
{
let mut maxflow = M::new(g);
maxflow.solve(src, snk, upper);
(maxflow.value(), maxflow.flow_vec(), maxflow.mincut())
}
pub fn edmondskarp<'a, 'b, G, F>(
g: &'a G,
src: G::Node,
snk: G::Node,
upper: &EdgeSlice<'a, 'b, G, F>,
) -> (F, EdgeVec<'a, G, F>, Vec<G::Node>)
where
G: IndexNetwork<'a>,
F: NumAssign + Ord + Copy,
{
solve::<G, F, EdmondsKarp<G, F>>(g, src, snk, upper)
}
pub fn dinic<'a, 'b, G, F>(
g: &'a G,
src: G::Node,
snk: G::Node,
upper: &EdgeSlice<'a, 'b, G, F>,
) -> (F, EdgeVec<'a, G, F>, Vec<G::Node>)
where
G: IndexNetwork<'a>,
F: NumAssign + Ord + Copy,
{
solve::<G, F, Dinic<G, F>>(g, src, snk, upper)
}
pub fn pushrelabel<'a, 'b, G, F>(
g: &'a G,
src: G::Node,
snk: G::Node,
upper: &EdgeSlice<'a, 'b, G, F>,
) -> (F, EdgeVec<'a, G, F>, Vec<G::Node>)
where
G: IndexNetwork<'a>,
F: NumAssign + Ord + Copy,
{
solve::<G, F, PushRelabel<G, F>>(g, src, snk, upper)
}
pub mod edmondskarp;
pub use self::edmondskarp::EdmondsKarp;
pub mod dinic;
pub use self::dinic::Dinic;
pub mod pushrelabel;
pub use self::pushrelabel::PushRelabel;