49 #ifndef vtkBoostPrimMinimumSpanningTree_h
50 #define vtkBoostPrimMinimumSpanningTree_h
52 #include "vtkInfovisBoostGraphAlgorithmsModule.h"
74 vtkSetStringMacro(EdgeWeightArrayName);
97 vtkSetMacro(CreateGraphVertexIdArray,
bool);
98 vtkGetMacro(CreateGraphVertexIdArray,
bool);
99 vtkBooleanMacro(CreateGraphVertexIdArray,
bool);
110 void SetNegateEdgeWeights(
bool value);
111 vtkGetMacro(NegateEdgeWeights,
bool);
112 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.
Wrapper around std::string to keep symbols short.
Superclass for algorithms that produce only Tree as output.
Abstract superclass for all arrays.
virtual int RequestData(vtkInformation *request, vtkInformationVector **inputVector, vtkInformationVector *outputVector)
This is called by the superclass.
Constructs a minimum spanning tree from a graph, start node, and the weighting array.
A atomic type representing the union of many types.
a simple class to control print indentation
static vtkTreeAlgorithm * New()
void PrintSelf(ostream &os, vtkIndent indent) override
Methods invoked by print to print information about the object including superclasses.