48 #ifndef vtkBoostPrimMinimumSpanningTree_h 49 #define vtkBoostPrimMinimumSpanningTree_h 95 void SetNegateEdgeWeights(
bool value);
113 char* EdgeWeightArrayName;
116 bool CreateGraphVertexIdArray;
119 bool NegateEdgeWeights;
120 float EdgeWeightMultiplier;
Wrapper around std::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.
#define vtkGetMacro(name, type)
GLsizei const GLfloat * value
void PrintSelf(ostream &os, vtkIndent indent)
#define vtkSetStringMacro(name)
#define vtkTypeMacro(thisClass, superclass)
A atomic type representing the union of many types.
a simple class to control print indentation
#define VTKINFOVISBOOSTGRAPHALGORITHMS_EXPORT
#define vtkBooleanMacro(name, type)
static vtkTreeAlgorithm * New()
virtual int FillInputPortInformation(int port, vtkInformation *info)
#define vtkSetMacro(name, type)