Find the connected components of a graph.
More...
#include <vtkBoostConnectedComponents.h>
Inherits vtkGraphAlgorithm.
Find the connected components of a graph.
vtkBoostConnectedComponents discovers the connected regions of a vtkGraph. Each vertex is assigned a component ID in the vertex array "component". If the graph is undirected, this is the natural connected components of the graph. If the graph is directed, this filter discovers the strongly connected components of the graph (i.e. the maximal sets of vertices where there is a directed path between any pair of vertices within each set).
- Examples:
- vtkBoostConnectedComponents (Examples)
- Tests:
- vtkBoostConnectedComponents (Tests)
Definition at line 45 of file vtkBoostConnectedComponents.h.
vtkBoostConnectedComponents::vtkBoostConnectedComponents |
( |
| ) |
|
|
protected |
vtkBoostConnectedComponents::~vtkBoostConnectedComponents |
( |
| ) |
|
|
protected |
static int vtkBoostConnectedComponents::IsTypeOf |
( |
const char * |
type | ) |
|
|
static |
virtual int vtkBoostConnectedComponents::IsA |
( |
const char * |
type | ) |
|
|
virtual |
virtual vtkObjectBase* vtkBoostConnectedComponents::NewInstanceInternal |
( |
| ) |
const |
|
protectedvirtual |
void vtkBoostConnectedComponents::PrintSelf |
( |
ostream & |
os, |
|
|
vtkIndent |
indent |
|
) |
| |
int vtkBoostConnectedComponents::RequestData |
( |
vtkInformation * |
, |
|
|
vtkInformationVector ** |
, |
|
|
vtkInformationVector * |
|
|
) |
| |
|
protected |
The documentation for this class was generated from the following file: