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
|
/*PGR-GNU*****************************************************************
File: breadthFirstSearch.hpp
Copyright (c) 2019 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_BREADTHFIRSTSEARCH_BREADTHFIRSTSEARCH_HPP_
#define INCLUDE_BREADTHFIRSTSEARCH_BREADTHFIRSTSEARCH_HPP_
#pragma once
#include <vector>
#include <set>
#include <cstdint>
#include <boost/config.hpp>
#include <boost/graph/breadth_first_search.hpp>
#include "cpp_common/base_graph.hpp"
#include "cpp_common/interruption.hpp"
#include "c_types/mst_rt.h"
#include "visitors/edges_order_bfs_visitor.hpp"
//******************************************
namespace pgrouting {
namespace functions {
template <class G>
class Pgr_breadthFirstSearch {
public:
typedef typename G::V V;
typedef typename G::E E;
typedef typename G::B_G B_G;
std::vector<MST_rt> breadthFirstSearch(
const G &graph,
const std::set<int64_t> &start_vertex,
int64_t depth) {
std::vector<MST_rt> results;
using bfs_visitor = visitors::Edges_order_bfs_visitor<E>;
for (auto source : start_vertex) {
std::vector<E> visited_order;
if (graph.has_vertex(source)) {
results.push_back({source, 0, source, source, -1, 0.0, 0.0});
boost::breadth_first_search(graph.graph,
graph.get_V(source),
visitor(bfs_visitor(visited_order)));
auto single_source_results = get_results(visited_order, source, depth, graph);
results.insert(results.end(), single_source_results.begin(), single_source_results.end());
/* abort in case of an interruption occurs (e.g. the query is being cancelled) */
CHECK_FOR_INTERRUPTS();
}
}
return results;
}
private:
template <typename T>
std::vector<MST_rt> get_results(
T order,
int64_t source,
int64_t max_depth,
const G &graph) {
std::vector<MST_rt> results;
std::vector<double> agg_cost(graph.num_vertices(), 0);
std::vector<int64_t> depth(graph.num_vertices(), 0);
for (const auto edge : order) {
auto u = graph.source(edge);
auto v = graph.target(edge);
agg_cost[v] = agg_cost[u] + graph[edge].cost;
depth[v] = depth[u] + 1;
if (max_depth >= depth[v]) {
results.push_back({
source,
depth[v],
graph[u].id,
graph[v].id,
graph[edge].id,
graph[edge].cost,
agg_cost[v]
});
}
}
return results;
}
};
} // namespace functions
} // namespace pgrouting
#endif // INCLUDE_BREADTHFIRSTSEARCH_BREADTHFIRSTSEARCH_HPP_
|
