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
|
/*PGR-GNU*****************************************************************
File: sequentialVertexColoring.hpp
Copyright (c) 2013-2026 pgRouting developers
Mail: project@pgrouting.org
Copyright (c) 2020 Ashish Kumar
Mail: ashishkr23438@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_COLORING_SEQUENTIALVERTEXCOLORING_HPP_
#define INCLUDE_COLORING_SEQUENTIALVERTEXCOLORING_HPP_
#pragma once
#include <algorithm>
#include <vector>
#include <map>
#include <cstdint>
#include <boost/property_map/property_map.hpp>
#include <boost/graph/graph_traits.hpp>
#include <boost/property_map/vector_property_map.hpp>
#include <boost/type_traits.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/sequential_vertex_coloring.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_sequentialVertexColoring {
public:
typedef typename G::V V;
typedef typename G::E E;
typedef boost::adjacency_list < boost::listS, boost::vecS, boost::undirectedS > Graph;
typedef boost::graph_traits < Graph > ::vertices_size_type vertices_size_type;
/** @name SequentialVertexColoring
* @{
*
*/
/** @brief sequentialVertexColoring function
*
* It does all the processing and returns the results.
*
* @param graph the graph containing the edges
*
* @returns results, when results are found
*
* @see [boost::sequential_vertex_coloring]
* (https://www.boost.org/libs/graph/doc/sequential_vertex_coloring.html)
*/
std::vector <II_t_rt> sequentialVertexColoring(G &graph) {
std::vector <II_t_rt> results;
auto i_map = boost::get(boost::vertex_index, graph.graph);
// vector which will store the color of all the vertices in the graph
std::vector < vertices_size_type > colors(boost::num_vertices(graph.graph));
// An iterator property map which records the color of each vertex
auto color_map = boost::make_iterator_property_map(colors.begin(), i_map);
/* abort in case of an interruption occurs (e.g. the query is being cancelled) */
CHECK_FOR_INTERRUPTS();
try {
boost::sequential_vertex_coloring(graph.graph, color_map);
} catch (boost::exception const& ex) {
(void)ex;
throw;
} catch (std::exception &e) {
(void)e;
throw;
} catch (...) {
throw;
}
results = get_results(colors, graph);
return results;
}
//@}
private:
/** @brief to get the results
*
* Uses the `colors` vector to get the results i.e. the color of every vertex.
*
* @param colors vector which contains the color of every vertex
* @param graph the graph containing the edges
*
* @returns `results` vector
*/
std::vector <II_t_rt> get_results(
std::vector < vertices_size_type > &colors,
const G &graph) {
std::vector <II_t_rt> results;
typename boost::graph_traits < Graph > ::vertex_iterator v, vend;
for (boost::tie(v, vend) = vertices(graph.graph); v != vend; ++v) {
int64_t node = graph[*v].id;
auto color = colors[*v];
results.push_back({{node}, {static_cast<int64_t>(color + 1)}});
}
// ordering the results in an increasing order of the node id
std::sort(results.begin(), results.end(),
[](const II_t_rt row1, const II_t_rt row2) {
return row1.d1.id < row2.d1.id;
});
return results;
}
};
} // namespace functions
} // namespace pgrouting
#endif // INCLUDE_COLORING_SEQUENTIALVERTEXCOLORING_HPP_
|
