Go to the documentation of this file.
48 #ifndef vtkBoostPrimMinimumSpanningTree_h
49 #define vtkBoostPrimMinimumSpanningTree_h
113 char* EdgeWeightArrayName;
116 bool CreateGraphVertexIdArray;
119 bool NegateEdgeWeights;
120 float EdgeWeightMultiplier;
static vtkBoostPrimMinimumSpanningTree * New()
#define vtkTypeMacro(thisClass, superclass)
int FillInputPortInformation(int port, vtkInformation *info)
void SetNegateEdgeWeights(bool value)
void PrintSelf(ostream &os, vtkIndent indent)
void SetOriginVertex(vtkIdType index)
void SetOriginVertex(vtkStdString arrayName, vtkVariant value)
GLsizei const GLfloat * value
int RequestData(vtkInformation *, vtkInformationVector **, vtkInformationVector *)
a simple class to control print indentation
#define vtkSetStringMacro(name)
#define VTKINFOVISBOOSTGRAPHALGORITHMS_EXPORT
A atomic type representing the union of many types.
#define vtkGetMacro(name, type)
Superclass for algorithms that produce only Tree as output.
Abstract superclass for all arrays.
vtkBooleanMacro(IgnoreDriverBugs, bool)
vtkSetMacro(IgnoreDriverBugs, bool)
Contructs a minimum spanning tree from a graph, start node, and the weighting array.
vtkBoostPrimMinimumSpanningTree()
Wrapper around std::string to keep symbols short.
~vtkBoostPrimMinimumSpanningTree()