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
|
/*PGR-GNU*****************************************************************
File: components.hpp
Copyright (c) 2013-2026 pgRouting developers
Mail: project@pgrouting.org
Copyright (c) 2017 Maoguang Wang
Mail: xjtumg1007@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_COMPONENTS_COMPONENTS_HPP_
#define INCLUDE_COMPONENTS_COMPONENTS_HPP_
#pragma once
#include <vector>
#include <map>
#include <utility>
#include <algorithm>
#include <cstdint>
#include <boost/config.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/connected_components.hpp>
#include <boost/graph/strong_components.hpp>
#include <boost/graph/biconnected_components.hpp>
#include "cpp_common/base_graph.hpp"
#include "cpp_common/identifiers.hpp"
#include "components/componentsResult.hpp"
namespace pgrouting {
namespace algorithms {
/**
* works for undirected graph
**/
std::vector<II_t_rt>
pgr_connectedComponents(pgrouting::UndirectedGraph &graph);
//! Strongly Connected Components Vertex Version
std::vector<II_t_rt>
strongComponents(pgrouting::DirectedGraph &graph);
//! Biconnected Components (for undirected)
std::vector<II_t_rt>
biconnectedComponents(pgrouting::UndirectedGraph &graph);
//! Articulation Points
Identifiers<int64_t>
articulationPoints(pgrouting::UndirectedGraph &graph);
//! Bridges
Identifiers<int64_t>
bridges(pgrouting::UndirectedGraph &graph);
} // namespace algorithms
} // namespace pgrouting
#endif // INCLUDE_COMPONENTS_COMPONENTS_HPP_
|
