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
|
:file: This file is part of the pgRouting project.
:copyright: Copyright (c) 2016-2026 pgRouting developers
:license: Creative Commons Attribution-Share Alike 3.0 https://creativecommons.org/licenses/by-sa/3.0
.. index::
single: Components Family ; pgr_biconnectedComponents
single: biconnectedComponents
|
``pgr_biconnectedComponents``
===============================================================================
``pgr_biconnectedComponents`` — Biconnected components of an undirected graph.
.. rubric:: Availability
* Version 3.0.0
* Result columns change:
* ``n_seq`` is removed
* ``seq`` changed type to ``BIGINT``
* Function promoted to official.
* Version 2.5.0
* New experimental function.
Description
-------------------------------------------------------------------------------
The biconnected components of an undirected graph are the maximal subsets of
vertices such that the removal of a vertex from particular component will not
disconnect the component.
Unlike connected components, vertices may belong to multiple biconnected
components.
Vertices can be present in multiple biconnected components, but each edge can
only be contained in a single biconnected component.
**The main characteristics are:**
- Works for **undirected** graphs.
- Components are described by edges.
- The returned values are ordered:
- ``component`` ascending.
- ``edge`` ascending.
- Running time: :math:`O(V + E)`
|Boost| Boost Graph Inside
Signatures
-------------------------------------------------------------------------------
.. admonition:: \ \
:class: signatures
| pgr_biconnectedComponents(`Edges SQL`_)
| Returns set of |result-component-E|
| OR EMPTY SET
:Example: The biconnected components of the graph
.. literalinclude:: biconnectedComponents.queries
:start-after: -- q1
:end-before: -- q2
.. figure:: /images/bcc_sampledata.png
:scale: 25%
Parameters
-------------------------------------------------------------------------------
.. include:: pgRouting-concepts.rst
:start-after: only_edge_param_start
:end-before: only_edge_param_end
Inner Queries
-------------------------------------------------------------------------------
Edges SQL
...............................................................................
.. include:: pgRouting-concepts.rst
:start-after: basic_edges_sql_start
:end-before: basic_edges_sql_end
Result columns
-------------------------------------------------------------------------------
Returns set of |result-component-E|
.. list-table::
:width: 81
:widths: auto
:header-rows: 1
* - Column
- Type
- Description
* - ``seq``
- ``BIGINT``
- Sequential value starting from **1**.
* - ``component``
- ``BIGINT``
- Component identifier.
* Has the value of the minimum edge identifier in the component.
* - ``edge``
- ``BIGINT``
- Identifier of the edge that belongs to the ``component``.
See Also
-------------------------------------------------------------------------------
* :doc:`components-family`
* :doc:`sampledata`
* `Boost: Biconnected components & articulation points
<https://www.boost.org/libs/graph/doc/biconnected_components.html>`__
* wikipedia: `Biconnected component
<https://en.wikipedia.org/wiki/Biconnected_component>`__
.. rubric:: Indices and tables
* :ref:`genindex`
* :ref:`search`
|
