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
|
/*PGR-GNU*****************************************************************
File: minCostMaxFlow.hpp
Copyright (c) 2018-2026 pgRouting developers
Mail: project@pgrouting.org
Copyright (c) 2018 Maoguang Wang
Mail: xjtumg1007@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_MINCOSTMAXFLOW_HPP_
#define INCLUDE_MAX_FLOW_MINCOSTMAXFLOW_HPP_
#pragma once
#include <map>
#include <string>
#include <utility>
#include <vector>
#include <set>
#include <limits>
#include <cstdint>
#include <boost/graph/successive_shortest_path_nonnegative_weights.hpp>
#include <boost/graph/find_flow_cost.hpp>
#include "c_types/flow_t.h"
#include "cpp_common/costFlow_t.hpp"
#include "max_flow/costFlowGraph.hpp"
namespace pgrouting {
namespace graph {
class PgrCostFlowGraph {
typedef Traits::vertex_descriptor V;
typedef Traits::edge_descriptor E;
typedef boost::graph_traits<CostFlowGraph>::vertex_iterator V_it;
typedef boost::graph_traits<CostFlowGraph>::edge_iterator E_it;
Capacity capacity;
ResidualCapacity residual_capacity;
Reversed rev;
Weight weight;
public:
double MinCostMaxFlow() {
boost::successive_shortest_path_nonnegative_weights(
graph,
supersource,
supersink);
return boost::find_flow_cost(graph);
}
PgrCostFlowGraph() = delete;
PgrCostFlowGraph(
const std::vector<CostFlow_t> &edges,
const std::set<int64_t> &source_vertices,
const std::set<int64_t> &sink_vertices);
int64_t GetMaxFlow() const;
std::vector<Flow_t> GetFlowEdges() const;
private:
V GetBoostVertex(int64_t id) const {
return idToV.at(id);
}
int64_t GetVertexId(V v) const {
return vToId.at(v);
}
int64_t GetEdgeId(E e) const {
return eToId.find(e) == eToId.end()? -1 : eToId.at(e);
}
void SetSupersource(
const std::set<int64_t> &source_vertices);
void SetSupersink(
const std::set<int64_t> &sink_vertices);
E AddEdge(V v, V w, double wei, double cap);
void InsertEdges(
const std::vector<CostFlow_t> &edges);
/*
* vertices = {sources} U {sink} U {edges.source} U {edge.target}
*/
template <typename T>
void AddVertices(
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);
idToV.insert(std::pair<int64_t, V>(id, v));
vToId.insert(std::pair<V, int64_t>(v, id));
}
SetSupersource(source_vertices);
SetSupersink(sink_vertices);
}
private:
CostFlowGraph graph;
std::map<int64_t, V> idToV;
std::map<V, int64_t> vToId;
std::map<E, int64_t> eToId;
/* 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_MINCOSTMAXFLOW_HPP_
|
