36 #ifndef __vtkPBGLMinimumSpanningTree_h
37 #define __vtkPBGLMinimumSpanningTree_h
39 #include "vtkInfovisParallelModule.h"
40 #include "vtkStdString.h"
41 #include "vtkVariant.h"
52 void PrintSelf(ostream& os, vtkIndent indent);
59 vtkSetStringMacro(EdgeWeightArrayName);
66 vtkSetStringMacro(OutputSelectionType);
75 vtkInformationVector **,
76 vtkInformationVector *);
79 int port, vtkInformation* info);
82 int port, vtkInformation* info);
85 char* EdgeWeightArrayName;
86 char* OutputSelectionType;
static vtkGraphAlgorithm * New()
Minimum spanning tree of a distributed vtkGraph.
A node in a selection tree. Used to store selection results.
virtual int FillOutputPortInformation(int port, vtkInformation *info)
Superclass for algorithms that produce only graph as output.
void PrintSelf(ostream &os, vtkIndent indent)
virtual int RequestData(vtkInformation *request, vtkInformationVector **inputVector, vtkInformationVector *outputVector)
virtual int FillInputPortInformation(int port, vtkInformation *info)