31 #ifndef vtkBoostBetweennessClustering_h 32 #define vtkBoostBetweennessClustering_h 35 #include "vtkInfovisBoostGraphAlgorithmsModule.h" 52 vtkSetMacro(Threshold,
double);
53 vtkGetMacro(Threshold,
double);
61 vtkSetMacro(UseEdgeWeightArray,
bool);
62 vtkBooleanMacro(UseEdgeWeightArray,
bool);
65 vtkSetMacro(InvertEdgeWeightArray,
bool);
66 vtkBooleanMacro(InvertEdgeWeightArray,
bool);
73 vtkGetStringMacro(EdgeWeightArrayName);
74 vtkSetStringMacro(EdgeWeightArrayName);
82 vtkSetStringMacro(EdgeCentralityArrayName);
93 bool UseEdgeWeightArray;
94 bool InvertEdgeWeightArray;
95 char* EdgeWeightArrayName;
96 char* EdgeCentralityArrayName;
102 #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.