31 #ifndef vtkBoostBetweennessClustering_h 32 #define vtkBoostBetweennessClustering_h 34 #include "vtkInfovisBoostGraphAlgorithmsModule.h" 53 vtkSetMacro(Threshold,
double);
54 vtkGetMacro(Threshold,
double);
62 vtkSetMacro(UseEdgeWeightArray,
bool);
63 vtkBooleanMacro(UseEdgeWeightArray,
bool);
66 vtkSetMacro(InvertEdgeWeightArray,
bool);
67 vtkBooleanMacro(InvertEdgeWeightArray,
bool);
74 vtkGetStringMacro(EdgeWeightArrayName);
75 vtkSetStringMacro(EdgeWeightArrayName);
83 vtkSetStringMacro(EdgeCentralityArrayName);
98 bool UseEdgeWeightArray;
99 bool InvertEdgeWeightArray;
100 char* EdgeWeightArrayName;
101 char* EdgeCentralityArrayName;
107 #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.