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
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
|
/*PGR-GNU*****************************************************************
File: maxflow.hpp
Copyright (c) 2013-2026 pgRouting developers
Mail: project@pgrouting.org
Copyright (c) 2016 Andrea Nardelli
Mail: nrd.nardelli@gmail.com
------
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
********************************************************************PGR-GNU*/
#ifndef INCLUDE_MAX_FLOW_MAXFLOW_HPP_
#define INCLUDE_MAX_FLOW_MAXFLOW_HPP_
#pragma once
#include <map>
#include <string>
#include <utility>
#include <vector>
#include <set>
#include <limits>
#include <cstdint>
#include "max_flow/flowgraph.hpp"
#include <boost/graph/push_relabel_max_flow.hpp>
#include <boost/graph/edmonds_karp_max_flow.hpp>
#include <boost/graph/boykov_kolmogorov_max_flow.hpp>
#include "c_types/flow_t.h"
#include "cpp_common/edge_t.hpp"
#include "c_types/path_rt.h"
#include "cpp_common/interruption.hpp"
namespace pgrouting {
namespace graph {
class PgrFlowGraph {
typedef boost::graph_traits<FlowGraph>::vertex_descriptor V;
typedef boost::graph_traits<FlowGraph>::edge_descriptor E;
typedef boost::graph_traits<FlowGraph>::vertex_iterator V_it;
typedef boost::graph_traits<FlowGraph>::edge_iterator E_it;
typedef boost::graph_traits<FlowGraph>::out_edge_iterator Eout_it;
boost::property_map
<FlowGraph, boost::edge_capacity_t>::type capacity;
boost::property_map
<FlowGraph, boost::edge_reverse_t>::type rev;
boost::property_map
<FlowGraph, boost::edge_residual_capacity_t>::type residual_capacity;
public:
int64_t push_relabel() {
/* abort in case of an interruption occurs (e.g. the query is being cancelled) */
CHECK_FOR_INTERRUPTS();
return boost::push_relabel_max_flow(
graph,
supersource,
supersink);
}
int64_t edmonds_karp() {
/* abort in case of an interruption occurs (e.g. the query is being cancelled) */
CHECK_FOR_INTERRUPTS();
return boost::edmonds_karp_max_flow(
graph,
supersource,
supersink);
}
int64_t boykov_kolmogorov() {
/* abort in case of an interruption occurs (e.g. the query is being cancelled) */
CHECK_FOR_INTERRUPTS();
return boost::boykov_kolmogorov_max_flow(
graph,
supersource,
supersink);
}
std::vector<Path_rt> edge_disjoint_paths() {
/* abort in case of an interruption occurs (e.g. the query is being cancelled) */
CHECK_FOR_INTERRUPTS();
auto flow = boost::boykov_kolmogorov_max_flow(
graph,
supersource,
supersink);
return get_edge_disjoint_paths(static_cast<size_t>(flow));
}
PgrFlowGraph(
const std::vector<Edge_t> &edges,
const std::set<int64_t> &source_vertices,
const std::set<int64_t> &sink_vertices,
int algorithm);
PgrFlowGraph(
const std::vector<Edge_t> &edges,
const std::set<int64_t> &source_vertices,
const std::set<int64_t> &sink_vertices,
bool directed);
std::vector<Flow_t> get_flow_edges() const;
std::vector<Path_rt> get_edge_disjoint_paths(
size_t flow);
private:
V get_boost_vertex(int64_t id) const {
return id_to_V.at(id);
}
int64_t get_vertex_id(V v) const {
return V_to_id.at(v);
}
int64_t get_edge_id(E e) const {
return E_to_id.at(e);
}
void set_supersource(
const std::set<int64_t> &source_vertices);
void set_supersink(
const std::set<int64_t> &sink_vertices);
void insert_edges_push_relabel(
const std::vector<Edge_t> &edges);
void insert_edges(
const std::vector<Edge_t> &edges);
void insert_edges_edge_disjoint(
const std::vector<Edge_t> &edges,
bool directed);
void flow_dfs(
V vertex,
size_t path_id,
std::vector<std::vector<int64_t> > &paths);
/*
* vertices = {sources} U {sink} U {edges.source} U {edge.target}
*/
template <typename T>
void add_vertices(
const T &edges,
const std::set<int64_t> &source_vertices,
const std::set<int64_t> &sink_vertices) {
std::set<int64_t> vertices(source_vertices);
vertices.insert(sink_vertices.begin(), sink_vertices.end());
for (const auto e : edges) {
vertices.insert(e.source);
vertices.insert(e.target);
}
for (const auto id : vertices) {
V v = add_vertex(graph);
id_to_V.insert(std::pair<int64_t, V>(id, v));
V_to_id.insert(std::pair<V, int64_t>(v, id));
}
set_supersource(source_vertices);
set_supersink(sink_vertices);
}
private:
FlowGraph graph;
std::map<int64_t, V> id_to_V;
std::map<V, int64_t> V_to_id;
std::map<E, int64_t> E_to_id;
/* In multi source flow graphs, a super source is created connected to all sources with "infinite" capacity
* The same applies for sinks.
* To avoid code repetition, a supersource/sink is used even in the one to one signature.
*/
V supersource;
V supersink;
};
} // namespace graph
} // namespace pgrouting
#endif // INCLUDE_MAX_FLOW_MAXFLOW_HPP_
|
