48 #ifndef __vtkBoostPrimMinimumSpanningTree_h
49 #define __vtkBoostPrimMinimumSpanningTree_h
51 #include "vtkInfovisBoostGraphAlgorithmsModule.h"
52 #include "vtkStdString.h"
53 #include "vtkVariant.h"
62 void PrintSelf(ostream& os, vtkIndent indent);
69 vtkSetStringMacro(EdgeWeightArrayName);
74 void SetOriginVertex(vtkIdType index);
80 void SetOriginVertex(vtkStdString arrayName, vtkVariant value);
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);
106 vtkInformationVector **,
107 vtkInformationVector *);
110 int port, vtkInformation* info);
113 char* EdgeWeightArrayName;
114 vtkIdType OriginVertexIndex;
115 vtkVariant OriginValue;
116 bool CreateGraphVertexIdArray;
119 bool NegateEdgeWeights;
120 float EdgeWeightMultiplier;
124 vtkSetStringMacro(ArrayName);
130 vtkIdType GetVertexIndex(
131 vtkAbstractArray *
abstract,vtkVariant value);
Superclass for algorithms that produce only Tree as output.
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)
static vtkTreeAlgorithm * New()
virtual int FillInputPortInformation(int port, vtkInformation *info)