48 #ifndef __vtkBoostPrimMinimumSpanningTree_h
49 #define __vtkBoostPrimMinimumSpanningTree_h
68 vtkSetStringMacro(EdgeWeightArrayName);
84 vtkSetMacro(CreateGraphVertexIdArray,
bool);
85 vtkGetMacro(CreateGraphVertexIdArray,
bool);
86 vtkBooleanMacro(CreateGraphVertexIdArray,
bool);
94 void SetNegateEdgeWeights(
bool value);
95 vtkGetMacro(NegateEdgeWeights,
bool);
96 vtkBooleanMacro(NegateEdgeWeights,
bool);
112 char* EdgeWeightArrayName;
115 bool CreateGraphVertexIdArray;
118 bool NegateEdgeWeights;
119 float EdgeWeightMultiplier;
123 vtkSetStringMacro(ArrayName);
Wrapper around vtkstd::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)