33 #ifndef __vtkBoostBetweennessClustering_h
34 #define __vtkBoostBetweennessClustering_h
52 vtkSetMacro(Threshold,
double);
53 vtkGetMacro(Threshold,
double);
59 vtkSetMacro(UseEdgeWeightArray,
bool);
60 vtkBooleanMacro(UseEdgeWeightArray,
bool);
63 vtkSetMacro(InvertEdgeWeightArray,
bool);
64 vtkBooleanMacro(InvertEdgeWeightArray,
bool);
69 vtkGetStringMacro(EdgeWeightArrayName);
70 vtkSetStringMacro(EdgeWeightArrayName);
76 vtkSetStringMacro(EdgeCentralityArrayName);
91 bool UseEdgeWeightArray;
92 bool InvertEdgeWeightArray;
93 char* EdgeWeightArrayName;
94 char* EdgeCentralityArrayName;
100 #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
void PrintSelf(ostream &os, vtkIndent indent)
virtual int RequestData(vtkInformation *request, vtkInformationVector **inputVector, vtkInformationVector *outputVector)
Implements graph clustering based on edge betweenness centrality.