39 #ifndef vtkBoostBreadthFirstSearchTree_h
40 #define vtkBoostBreadthFirstSearchTree_h
42 #include "vtkInfovisBoostGraphAlgorithmsModule.h"
75 vtkSetMacro(CreateGraphVertexIdArray,
bool);
76 vtkGetMacro(CreateGraphVertexIdArray,
bool);
77 vtkBooleanMacro(CreateGraphVertexIdArray,
bool);
84 vtkSetMacro(ReverseEdges,
bool);
85 vtkGetMacro(ReverseEdges,
bool);
86 vtkBooleanMacro(ReverseEdges,
bool);
102 bool CreateGraphVertexIdArray;
109 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.