33 #ifndef vtkBoostBetweennessClustering_h
34 #define vtkBoostBetweennessClustering_h
36 #include "vtkInfovisBoostGraphAlgorithmsModule.h"
60 vtkSetMacro(UseEdgeWeightArray,
bool);
61 vtkBooleanMacro(UseEdgeWeightArray,
bool);
64 vtkSetMacro(InvertEdgeWeightArray,
bool);
65 vtkBooleanMacro(InvertEdgeWeightArray,
bool);
70 vtkGetStringMacro(EdgeWeightArrayName);
71 vtkSetStringMacro(EdgeWeightArrayName);
77 vtkSetStringMacro(EdgeCentralityArrayName);
92 bool UseEdgeWeightArray;
93 bool InvertEdgeWeightArray;
94 char* EdgeWeightArrayName;
95 char* EdgeCentralityArrayName;
101 #endif // vtkBoostBetweennessClustering_h
static vtkGraphAlgorithm * New()
virtual int FillOutputPortInformation(int port, vtkInformation *info)
Superclass for algorithms that produce only graph as output.
a simple class to control print indentation
int Threshold(vtkDataSet *input, vtkUnstructuredGrid *output, vtkDataArray *field, double lower, double upper)
void PrintSelf(ostream &os, vtkIndent indent)
virtual int RequestData(vtkInformation *request, vtkInformationVector **inputVector, vtkInformationVector *outputVector)
Implements graph clustering based on edge betweenness centrality.