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
|
/*PGR-GNU*****************************************************************
File: line_graph.hpp
Function's developer:
Copyright (c) 2024 Vicky Vergara
Mail: vicky at 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_BGRAPH_LINE_GRAPH_HPP_
#define INCLUDE_BGRAPH_LINE_GRAPH_HPP_
#include <map>
#include <cstdint>
#include <boost/config.hpp>
#include <boost/graph/adjacency_list.hpp>
#include "cpp_common/basic_vertex.hpp"
#include "cpp_common/basic_edge.hpp"
namespace pgrouting {
namespace b_g {
using B_G_R = boost::adjacency_list<
boost::vecS, boost::vecS, boost::undirectedS,
pgrouting::Basic_vertex, pgrouting::Basic_edge>;
template<typename B_G>
B_G_R line_graph(const B_G& original) {
using V = typename boost::graph_traits<B_G_R>::vertex_descriptor;
using IndexMap = std::map<int64_t, V>;
B_G_R result;
IndexMap id_to_descriptor;
auto o_edges = boost::edges(original);
for (auto e = o_edges.first; e != o_edges.second; ++e) {
auto v = add_vertex(result);
result[v].id = original[*e].id;
id_to_descriptor[original[*e].id] = v;
}
/* for (each vertex v in original graph) */
auto vs = boost::vertices(original);
for (auto vertexIt = vs.first; vertexIt != vs.second; vertexIt++) {
auto vertex = *vertexIt;
/* for( all incoming edges in to vertex v) */
auto o_inedges = boost::in_edges(vertex, original);
for (auto ine = o_inedges.first; ine != o_inedges.second; ++ine) {
auto s = original[*ine].id;
auto o_out_edges = boost::out_edges(vertex, original);
for (auto eout = o_out_edges.first; eout != o_out_edges.second; ++eout) {
/* for( all outgoing edges out from vertex v) */
auto t = original[*eout].id;
auto rs = id_to_descriptor[s];
auto rt = id_to_descriptor[t];
auto e = boost::add_edge(rs, rt, result);
result[e.first].id = static_cast<int64_t>(num_edges(result));
}
}
}
return result;
}
} // namespace b_g
} // namespace pgrouting
#endif // INCLUDE_BGRAPH_LINE_GRAPH_HPP_
|
