34 #ifndef vtkBoostBetweennessClustering_h 35 #define vtkBoostBetweennessClustering_h 37 #include "vtkInfovisBoostGraphAlgorithmsModule.h" 56 vtkSetMacro(Threshold,
double);
57 vtkGetMacro(Threshold,
double);
65 vtkSetMacro(UseEdgeWeightArray,
bool);
66 vtkBooleanMacro(UseEdgeWeightArray,
bool);
69 vtkSetMacro(InvertEdgeWeightArray,
bool);
70 vtkBooleanMacro(InvertEdgeWeightArray,
bool);
77 vtkGetStringMacro(EdgeWeightArrayName);
78 vtkSetStringMacro(EdgeWeightArrayName);
86 vtkSetStringMacro(EdgeCentralityArrayName);
101 bool UseEdgeWeightArray;
102 bool InvertEdgeWeightArray;
103 char* EdgeWeightArrayName;
104 char* EdgeCentralityArrayName;
110 #endif // vtkBoostBetweennessClustering_h static vtkGraphAlgorithm * New()
Superclass for algorithms that produce only graph as output.
a simple class to control print indentation
int FillOutputPortInformation(int port, vtkInformation *info) override
Fill the output port information objects for this algorithm.
void PrintSelf(ostream &os, vtkIndent indent) override
Methods invoked by print to print information about the object including superclasses.
virtual int RequestData(vtkInformation *request, vtkInformationVector **inputVector, vtkInformationVector *outputVector)
This is called by the superclass.
Implements graph clustering based on edge betweenness centrality.