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
|
/*PGR-GNU*****************************************************************
File: transitiveClosure.hpp
Generated with Template by:
Copyright (c) 2019-2026 pgRouting developers
Mail: project@pgrouting.org
Function's developer:
Copyright (c) 2019 Hang Wu
mail: nike0good@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_TRANSITIVECLOSURE_TRANSITIVECLOSURE_HPP_
#define INCLUDE_TRANSITIVECLOSURE_TRANSITIVECLOSURE_HPP_
#pragma once
#include <deque>
#include <vector>
#include <utility>
#include <boost/graph/transitive_closure.hpp>
#include "cpp_common/assert.hpp"
template < class G > class Pgr_transitiveClosure;
template < class G >
class Pgr_transitiveClosure {
public:
typedef typename G::V V;
boost::adjacency_list <boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::no_property,
boost::no_property, boost::listS> transitiveClosure(G &graph);
private:
boost::adjacency_list <boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::no_property,
boost::no_property, boost::listS> generatetransitiveClosure(G &graph) {
boost::adjacency_list <boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::no_property,
boost::no_property, boost::listS> TC;
transitive_closure(graph.graph, TC);
return TC;
}
};
template < class G >
boost::adjacency_list <boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::no_property,
boost::no_property, boost::listS>
Pgr_transitiveClosure< G >::transitiveClosure(
G &graph) {
return generatetransitiveClosure(
graph);
}
#endif // INCLUDE_TRANSITIVECLOSURE_TRANSITIVECLOSURE_HPP_
|
