48 #ifndef vtkBoostPrimMinimumSpanningTree_h
49 #define vtkBoostPrimMinimumSpanningTree_h
51 #include "vtkInfovisBoostGraphAlgorithmsModule.h"
69 vtkSetStringMacro(EdgeWeightArrayName);
85 vtkSetMacro(CreateGraphVertexIdArray,
bool);
86 vtkGetMacro(CreateGraphVertexIdArray,
bool);
87 vtkBooleanMacro(CreateGraphVertexIdArray,
bool);
95 void SetNegateEdgeWeights(
bool value);
96 vtkGetMacro(NegateEdgeWeights,
bool);
97 vtkBooleanMacro(NegateEdgeWeights,
bool);
113 char* EdgeWeightArrayName;
116 bool CreateGraphVertexIdArray;
119 bool NegateEdgeWeights;
120 float EdgeWeightMultiplier;
124 vtkSetStringMacro(ArrayName);
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)
Contructs a minimum spanning tree from a graph, start node, and the weighting array.
void PrintSelf(ostream &os, vtkIndent indent)
A atomic type representing the union of many types.
a simple class to control print indentation
static vtkTreeAlgorithm * New()
virtual int FillInputPortInformation(int port, vtkInformation *info)