Go to the documentation of this file.
49 #ifndef vtkBoostPrimMinimumSpanningTree_h
50 #define vtkBoostPrimMinimumSpanningTree_h
52 #include "vtkInfovisBoostGraphAlgorithmsModule.h"
73 vtkSetStringMacro(EdgeWeightArrayName);
97 vtkGetMacro(CreateGraphVertexIdArray,
bool);
110 vtkGetMacro(NegateEdgeWeights,
bool);
127 char* EdgeWeightArrayName;
130 bool CreateGraphVertexIdArray;
133 bool NegateEdgeWeights;
134 float EdgeWeightMultiplier;
140 vtkSetStringMacro(ArrayName);
static vtkBoostPrimMinimumSpanningTree * New()
int FillInputPortInformation(int port, vtkInformation *info)
Fill the input port information objects for this algorithm.
void SetNegateEdgeWeights(bool value)
Whether to negate the edge weights.
void PrintSelf(ostream &os, vtkIndent indent)
Methods invoked by print to print information about the object including superclasses.
void SetOriginVertex(vtkIdType index)
Set the index (into the vertex array) of the minimum spanning tree 'origin' vertex.
void SetOriginVertex(vtkStdString arrayName, vtkVariant value)
Set the minimum spanning tree 'origin' vertex.
int RequestData(vtkInformation *, vtkInformationVector **, vtkInformationVector *)
This is called by the superclass.
a simple class to control print indentation
A atomic type representing the union of many types.
Superclass for algorithms that produce only Tree as output.
Abstract superclass for all arrays.
vtkBooleanMacro(IgnoreDriverBugs, bool)
Updates the extensions string.
vtkSetMacro(IgnoreDriverBugs, bool)
Updates the extensions string.
Contructs a minimum spanning tree from a graph, start node, and the weighting array.
vtkBoostPrimMinimumSpanningTree()
Wrapper around std::string to keep symbols short.
~vtkBoostPrimMinimumSpanningTree()