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
|
/*PGR-GNU*****************************************************************
File: edwardMoore.hpp
Copyright (c) 2015-2026 pgRouting developers
Mail: project@pgrouting.org
Copyright (c) 2019 Gudesa Venkata Sai AKhil
Mail: gvs.akhil1997@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_BELLMAN_FORD_EDWARDMOORE_HPP_
#define INCLUDE_BELLMAN_FORD_EDWARDMOORE_HPP_
#pragma once
#include <limits>
#include <algorithm>
#include <vector>
#include <deque>
#include <set>
#include <map>
#include <cstdint>
#include "cpp_common/path.hpp"
#include "cpp_common/base_graph.hpp"
#include "cpp_common/interruption.hpp"
#include "c_types/ii_t_rt.h"
namespace pgrouting {
namespace functions {
template <class G>
class Pgr_edwardMoore {
public:
typedef typename G::V V;
typedef typename G::E E;
typedef typename G::EO_i EO_i;
/** @brief edwardMoore for combinations */
std::deque<Path> edwardMoore(
G &graph,
const std::map<int64_t, std::set<int64_t>> &combinations) {
std::deque<Path> paths;
for (const auto &comb : combinations) {
if (!graph.has_vertex(comb.first)) continue;
auto tmp_paths = one_to_many_edwardMoore(graph, comb.first, comb.second);
paths.insert(paths.end(), tmp_paths.begin(), tmp_paths.end());
}
std::sort(paths.begin(), paths.end(),
[](const Path &e1, const Path &e2) -> bool {
return e1.end_id() < e2.end_id();
});
std::stable_sort(paths.begin(), paths.end(),
[](const Path &e1, const Path &e2) -> bool {
return e1.start_id() < e2.start_id();
});
return paths;
}
private:
E default_edge;
std::deque<Path> one_to_many_edwardMoore(
G &graph,
int64_t start_vertex,
const std::set<int64_t> &end_vertex) {
std::deque<Path> paths;
if (graph.has_vertex(start_vertex) == false) {
return paths;
}
std::vector<double> current_cost(graph.num_vertices(), std::numeric_limits<double>::infinity());
std::vector<bool> isInQ(graph.num_vertices(), false);
std::vector<E> from_edge(graph.num_vertices());
std::deque<V> dq;
default_edge = from_edge[0];
auto bgl_start_vertex = graph.get_V(start_vertex);
current_cost[bgl_start_vertex] = 0;
isInQ[bgl_start_vertex] = true;
dq.push_front(bgl_start_vertex);
while (dq.empty() == false) {
auto head_vertex = dq.front();
dq.pop_front();
isInQ[head_vertex] = false;
updateVertexCosts(graph, current_cost, isInQ, from_edge, dq, head_vertex);
}
for (auto target_vertex : end_vertex) {
if (graph.has_vertex(target_vertex) == false) {
continue;
}
auto bgl_target_vertex = graph.get_V(target_vertex);
if (from_edge[bgl_target_vertex] == default_edge) {
continue;
}
paths.push_front(
getPath(graph, bgl_start_vertex, target_vertex, bgl_target_vertex, from_edge, current_cost));
}
return paths;
}
Path getPath(
G &graph,
V bgl_start_vertex,
int64_t target,
V bgl_target_vertex,
std::vector<E> &from_edge,
std::vector<double> ¤t_cost) {
auto current_node = bgl_target_vertex;
Path path = Path(graph[bgl_start_vertex].id, graph[current_node].id);
/* TODO(v4) add correct predecessor node */
path.push_back({target, -1, 0, current_cost[current_node], 0});
do {
E e = from_edge[current_node];
auto from = graph.source(e);
/* TODO(v4) add correct predecessor node */
path.push_back({graph[from].id, graph[e].id, graph[e].cost, current_cost[from], 0});
current_node = from;
} while (from_edge[current_node] != default_edge);
std::reverse(path.begin(), path.end());
return path;
}
void updateVertexCosts(
G &graph,
std::vector<double> ¤t_cost,
std::vector<bool> &isInQ,
std::vector<E> &from_edge,
std::deque<V> &dq,
V &head_vertex) {
/* abort in case of an interruption occurs (e.g. the query is being cancelled) */
CHECK_FOR_INTERRUPTS();
auto out_edges = boost::out_edges(head_vertex, graph.graph);
E e;
EO_i out_i;
EO_i out_end;
V v_source, v_target;
for (boost::tie(out_i, out_end) = out_edges;
out_i != out_end; ++out_i) {
e = *out_i;
v_target = graph.target(e);
v_source = graph.source(e);
double edge_cost = graph[e].cost;
if (std::isinf(current_cost[v_target]) || current_cost[v_source] + edge_cost < current_cost[v_target]) {
current_cost[v_target] = current_cost[v_source] + edge_cost;
from_edge[v_target] = e;
if (isInQ[v_target] == false) {
dq.push_back(v_target);
isInQ[v_target] = true;
}
}
}
}
};
} // namespace functions
} // namespace pgrouting
#endif // INCLUDE_BELLMAN_FORD_EDWARDMOORE_HPP_
|
