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
|
/*PGR-GNU*****************************************************************
File: dijkstraVia.hpp
Generated with Template by:
Copyright (c) 2017-2026 pgRouting developers
Function's developer:
Copyright (c) 2015 Celia Virginia Vergara Castillo
mail: vicky at erosion.dev
------
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_DIJKSTRA_DIJKSTRAVIA_HPP_
#define INCLUDE_DIJKSTRA_DIJKSTRAVIA_HPP_
#pragma once
#include <sstream>
#include <deque>
#include <vector>
#include <cstdint>
#include "dijkstra/dijkstra.hpp"
#include "cpp_common/assert.hpp"
namespace pgrouting {
template <class G>
void
dijkstraVia(
G &graph,
const std::vector<int64_t> &via_vertices,
std::deque<Path> &paths,
bool strict,
bool U_turn_on_edge,
std::ostringstream &log) {
if (via_vertices.size() == 0) {
return;
}
paths.clear();
int64_t prev_vertex = via_vertices[0];
Path path;
int64_t i = 0;
for (const auto &vertex : via_vertices) {
if (i == 0) {
prev_vertex = vertex; ++i;
continue;
}
// Delete U Turn edges only valid for paths that are not the first path
if (!U_turn_on_edge && i > 1) {
/*
* Can only delete if there was a path,
* that is at least one edge size
*/
if (path.size() > 1) {
/*
* Delete from the graph the last edge if its outgoing also
* edge to be removed = second to last edge path[i].edge;
*/
int64_t edge_to_be_removed = path[path.size() - 2].edge;
int64_t last_vertex_of_path = prev_vertex;
// and the current vertex is not a dead end
if (graph.out_degree(last_vertex_of_path) > 1) {
log << "\ndeparting from " << last_vertex_of_path
<< " deleting edge " << edge_to_be_removed << "\n";
graph.disconnect_out_going_edge(
last_vertex_of_path,
edge_to_be_removed);
}
}
}
log << "\nfrom " << prev_vertex << " to " << vertex;
path = algorithms::dijkstra(graph, prev_vertex, vertex);
if (!U_turn_on_edge && i > 1) {
graph.restore_graph();
if (path.empty()) {
/*
* no path was found with the deleted edge
* try with the edge back in the graph
*/
log << "\nEmpty so again from "
<< prev_vertex << " to " << vertex;
path = algorithms::dijkstra(graph, prev_vertex, vertex);
}
}
if (strict && path.empty()) {
paths.clear();
return;
}
paths.push_back(path);
/*
* got to the next
*/
prev_vertex = vertex; ++i;
}
}
} // namespace pgrouting
#endif // INCLUDE_DIJKSTRA_DIJKSTRAVIA_HPP_
|
