Inherits vtkUndirectedGraphAlgorithm.
Find the biconnected components of a graph.
The biconnected components of a graph are maximal regions of the graph where the removal of any single vertex from the region will not disconnect the graph. Every edge belongs to exactly one biconnected component. The biconnected component of each edge is given in the edge array named "biconnected component". The biconnected component of each vertex is also given in the vertex array named "biconnected component". Cut vertices (or articulation points) belong to multiple biconnected components, and break the graph apart if removed. These are indicated by assigning a component value of -1. To get the biconnected components that a cut vertex belongs to, traverse its edge list and collect the distinct component ids for its incident edges.
Self-loop edges that start and end at the same vertex are not assigned a biconnected component, and are given component id -1.
- Warning
- The boost graph bindings currently only support boost version 1.33.1. There are apparently backwards-compatibility issues with later versions.
- Examples:
- vtkBoostBiconnectedComponents (Examples)
- Tests:
- vtkBoostBiconnectedComponents (Tests)
Definition at line 56 of file vtkBoostBiconnectedComponents.h.