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
|
/*PGR-GNU*****************************************************************
File: undirectedNoCostBG.hpp
Copyright (c) 2025-2026 pgRouting developers
Mail: project@pgrouting.org
------
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_CPP_COMMON_UNDIRECTEDNOCOSTBG_HPP_
#define INCLUDE_CPP_COMMON_UNDIRECTEDNOCOSTBG_HPP_
#pragma once
#include <map>
#include <vector>
#include <boost/config.hpp>
#include <boost/graph/adjacency_list.hpp>
#include "c_types/edge_bool_t_rt.h"
namespace pgrouting {
namespace graph {
class UndirectedNoCostsBG {
public:
using G = boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS>;
using V = boost::graph_traits<G>::vertex_descriptor;
using E = boost::graph_traits<G>::edge_descriptor;
using V_it = boost::graph_traits<G>::vertex_iterator;
using Edge_bool_t = struct Edge_bool_t;
explicit UndirectedNoCostsBG(const std::vector<Edge_bool_t>&);
V get_boost_vertex(int64_t id) {
return id_to_V[id];
}
int64_t get_edge_id(E e) {
return E_to_id[e];
}
G& operator()() {return graph;}
const G& operator()() const {return graph;}
private:
G graph;
std::map<int64_t, V> id_to_V;
std::map<V, int64_t> V_to_id;
std::map<E, int64_t> E_to_id;
};
} // namespace graph
} // namespace pgrouting
#endif // INCLUDE_CPP_COMMON_UNDIRECTEDNOCOSTBG_HPP_
|
