42 #ifndef vtkBoostBreadthFirstSearchTree_h 43 #define vtkBoostBreadthFirstSearchTree_h 45 #include "vtkInfovisBoostGraphAlgorithmsModule.h" 78 vtkSetMacro(CreateGraphVertexIdArray,
bool);
79 vtkGetMacro(CreateGraphVertexIdArray,
bool);
80 vtkBooleanMacro(CreateGraphVertexIdArray,
bool);
87 vtkSetMacro(ReverseEdges,
bool);
88 vtkGetMacro(ReverseEdges,
bool);
89 vtkBooleanMacro(ReverseEdges,
bool);
106 bool CreateGraphVertexIdArray;
113 vtkSetStringMacro(ArrayName);
int FillInputPortInformation(int port, vtkInformation *info) override
Fill the input port information objects for this algorithm.
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)
This is called by the superclass.
A atomic type representing the union of many types.
Constructs a BFS tree from a graph.
a simple class to control print indentation
static vtkTreeAlgorithm * New()
void PrintSelf(ostream &os, vtkIndent indent) override
Methods invoked by print to print information about the object including superclasses.