Biconnectivity-test and low-numbers. More...
#include <GTL/biconnectivity.h>
Inherits: dfs
Obviously there is a close relationship between DFS and the testing of biconnectivity. Thus this test takes advantage of the possibility to add pieces of code to the DFS-class in order to calculate the low-numbers.
[public]
Creates biconnectivity algorithm object.
[public virtual]
Destroys biconnectivity algorithm object.
[public virtual]
Necessary preconditions:
G
is undirected.
G | graph. |
algorithm::GTL_OK
if binconnectivity-test can
be applied to G
.[public virtual]
Reset
[public]
Low-number.
n | node. |
n
.[public]
Biconnectivity-test.
[public]
Returns whether the storing of components is enabled.
[public]
Enables or disables the storing of biconnected components. If this feature is enabled, the whole graph will be scanned in order to get all the biconnected components even if the graph isn't connected. By default this feature is disabled.
set | if true each biconnected component will be stored. |
[public]
If enabled edges will be added to the graph in order to make it
biconnected, if cutpoints are discovered. The list of added edges
can be accessed via additional_begin
and
additional_end
.
set | if true additional edges will we inserted to make the graph biconnected. |
[public]
Returns whether addition of edges neccessary to make graph biconnected is enabled.
[public]
Begin of edges added to make graph biconnected.
[public]
End of edges added to make graph biconnected
[public]
Start iteration over all cutpoints found. A cutpoints is a node whose removal will disconnect the graph, thus a graph with no cutpoints is biconnected and vice versa.
[public]
End of iteration over all cutpoints.
[public]
Start iteration over all biconnected components (if enabled during
last call to run). Components are represented as a pair consisting of
a list of nodes and a list of edges,
i.e. if it
is of type component_iterator
then *it
is of type
pair<list<node>,list<edge> >
.
[public]
End of iteration over all biconnected components.
[public]
Number von biconnected components detected during the last run.
Kdoc |