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
|
/*PGR-GNU*****************************************************************
File: kruskal.hpp
Copyright (c) 2007-2026 pgRouting developers
Mail: project@pgrouting.org
Copyright (c) 2018 Aditya Pratap Singh
adityapratap.singh28@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_SPANNINGTREE_KRUSKAL_HPP_
#define INCLUDE_SPANNINGTREE_KRUSKAL_HPP_
#pragma once
#include <vector>
#include <cstdint>
#include <boost/graph/kruskal_min_spanning_tree.hpp>
#include "spanningTree/mst.hpp"
#include "cpp_common/interruption.hpp"
namespace pgrouting {
namespace functions {
template <class G>
class Pgr_kruskal : public Pgr_mst<G> {
public:
virtual ~Pgr_kruskal() = default;
std::vector<MST_rt> kruskal(G &graph);
std::vector<MST_rt> kruskalBFS(
G &graph,
std::vector<int64_t> roots,
int64_t max_depth);
std::vector<MST_rt> kruskalDFS(
G &graph,
std::vector<int64_t> roots,
int64_t max_depth);
std::vector<MST_rt> kruskalDD(
G &graph,
std::vector<int64_t> roots,
double distance);
private:
typedef typename G::B_G B_G;
typedef typename G::V V;
typedef typename G::E E;
/* Does all the work */
void generate_mst(const G &graph);
};
template <class G>
void
Pgr_kruskal<G>::generate_mst(const G &graph) {
this->clear();
/* abort in case of an interruption occurs (e.g. the query is being cancelled) */
CHECK_FOR_INTERRUPTS();
boost::kruskal_minimum_spanning_tree(
graph.graph,
std::inserter(this->m_spanning_tree.edges, this->m_spanning_tree.edges.begin()),
boost::weight_map(get(&G::G_T_E::cost, graph.graph)));
}
template <class G>
std::vector<MST_rt>
Pgr_kruskal<G>::kruskal(
G &graph) {
return this->mst(graph);
}
template <class G>
std::vector<MST_rt>
Pgr_kruskal<G>::kruskalBFS(
G &graph,
std::vector<int64_t> roots,
int64_t max_depth) {
return this->mstBFS(graph, roots, max_depth);
}
template <class G>
std::vector<MST_rt>
Pgr_kruskal<G>::kruskalDFS(
G &graph,
std::vector<int64_t> roots,
int64_t max_depth) {
return this->mstDFS(graph, roots, max_depth);
}
template <class G>
std::vector<MST_rt>
Pgr_kruskal<G>::kruskalDD(
G &graph,
std::vector<int64_t> roots,
double distance) {
return this->mstDD(graph, roots, distance);
}
} // namespace functions
} // namespace pgrouting
#endif // INCLUDE_SPANNINGTREE_KRUSKAL_HPP_
|
