34 #ifndef vtkBoostBetweennessClustering_h
35 #define vtkBoostBetweennessClustering_h
38 #include "vtkInfovisBoostGraphAlgorithmsModule.h"
55 vtkSetMacro(Threshold,
double);
56 vtkGetMacro(Threshold,
double);
64 vtkSetMacro(UseEdgeWeightArray,
bool);
65 vtkBooleanMacro(UseEdgeWeightArray,
bool);
68 vtkSetMacro(InvertEdgeWeightArray,
bool);
69 vtkBooleanMacro(InvertEdgeWeightArray,
bool);
76 vtkGetStringMacro(EdgeWeightArrayName);
77 vtkSetStringMacro(EdgeWeightArrayName);
85 vtkSetStringMacro(EdgeCentralityArrayName);
96 bool UseEdgeWeightArray;
97 bool InvertEdgeWeightArray;
98 char* EdgeWeightArrayName;
99 char* EdgeCentralityArrayName;
105 #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.