Go to the documentation of this file.
46 #ifndef vtkBoostPrimMinimumSpanningTree_h
47 #define vtkBoostPrimMinimumSpanningTree_h
49 #include "vtkInfovisBoostGraphAlgorithmsModule.h"
70 vtkSetStringMacro(EdgeWeightArrayName);
93 vtkSetMacro(CreateGraphVertexIdArray,
bool);
94 vtkGetMacro(CreateGraphVertexIdArray,
bool);
95 vtkBooleanMacro(CreateGraphVertexIdArray,
bool);
106 void SetNegateEdgeWeights(
bool value);
107 vtkGetMacro(NegateEdgeWeights,
bool);
108 vtkBooleanMacro(NegateEdgeWeights,
bool);
124 char* EdgeWeightArrayName;
127 bool CreateGraphVertexIdArray;
130 bool NegateEdgeWeights;
131 float EdgeWeightMultiplier;
137 vtkSetStringMacro(ArrayName);
int FillInputPortInformation(int port, vtkInformation *info) override
Fill the input port information objects for this algorithm.
static vtkTreeAlgorithm * New()
a simple class to control print indentation
A atomic type representing the union of many types.
void PrintSelf(ostream &os, vtkIndent indent) override
Methods invoked by print to print information about the object including superclasses.
Superclass for algorithms that produce only Tree as output.
virtual int RequestData(vtkInformation *request, vtkInformationVector **inputVector, vtkInformationVector *outputVector)
This is called by the superclass.
Abstract superclass for all arrays.
Constructs a minimum spanning tree from a graph, start node, and the weighting array.
Wrapper around std::string to keep symbols short.