|  | VTK
    9.0.1
    | 
 
 
 
Go to the documentation of this file.
   46 #ifndef vtkBoostPrimMinimumSpanningTree_h 
   47 #define vtkBoostPrimMinimumSpanningTree_h 
   49 #include "vtkInfovisBoostGraphAlgorithmsModule.h"  
   71   vtkSetStringMacro(EdgeWeightArrayName);
 
   94   vtkSetMacro(CreateGraphVertexIdArray, 
bool);
 
   95   vtkGetMacro(CreateGraphVertexIdArray, 
bool);
 
   96   vtkBooleanMacro(CreateGraphVertexIdArray, 
bool);
 
  107   void SetNegateEdgeWeights(
bool value);
 
  108   vtkGetMacro(NegateEdgeWeights, 
bool);
 
  109   vtkBooleanMacro(NegateEdgeWeights, 
bool);
 
  121   char* EdgeWeightArrayName;
 
  124   bool CreateGraphVertexIdArray;
 
  127   bool NegateEdgeWeights;
 
  128   float EdgeWeightMultiplier;
 
  134   vtkSetStringMacro(ArrayName);
 
  
int FillInputPortInformation(int port, vtkInformation *info) override
Fill the input port information objects for this algorithm.
static vtkTreeAlgorithm * New()
a simple class to control print indentation
A atomic type representing the union of many types.
void PrintSelf(ostream &os, vtkIndent indent) override
Methods invoked by print to print information about the object including superclasses.
Superclass for algorithms that produce only Tree as output.
virtual int RequestData(vtkInformation *request, vtkInformationVector **inputVector, vtkInformationVector *outputVector)
This is called by the superclass.
Abstract superclass for all arrays.
Constructs a minimum spanning tree from a graph, start node, and the weighting array.
Wrapper around std::string to keep symbols short.