1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
|
// SPDX-FileCopyrightText: Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
// SPDX-License-Identifier: BSD-3-Clause
/**
* @class vtkTreeBFSIterator
* @brief breadth first search iterator through a vtkTree
*
*
* vtkTreeBFSIterator performs a breadth first search traversal of a tree.
*
* After setting up the iterator, the normal mode of operation is to
* set up a <code>while(iter->HasNext())</code> loop, with the statement
* <code>vtkIdType vertex = iter->Next()</code> inside the loop.
*
* @par Thanks:
* Thanks to David Doria for submitting this class.
*/
#ifndef vtkTreeBFSIterator_h
#define vtkTreeBFSIterator_h
#include "vtkCommonDataModelModule.h" // For export macro
#include "vtkTreeIterator.h"
VTK_ABI_NAMESPACE_BEGIN
class vtkTreeBFSIteratorInternals;
class vtkIntArray;
class VTKCOMMONDATAMODEL_EXPORT vtkTreeBFSIterator : public vtkTreeIterator
{
public:
static vtkTreeBFSIterator* New();
vtkTypeMacro(vtkTreeBFSIterator, vtkTreeIterator);
void PrintSelf(ostream& os, vtkIndent indent) override;
protected:
vtkTreeBFSIterator();
~vtkTreeBFSIterator() override;
void Initialize() override;
vtkIdType NextInternal() override;
vtkTreeBFSIteratorInternals* Internals;
vtkIntArray* Color;
enum ColorType
{
WHITE,
GRAY,
BLACK
};
private:
vtkTreeBFSIterator(const vtkTreeBFSIterator&) = delete;
void operator=(const vtkTreeBFSIterator&) = delete;
};
VTK_ABI_NAMESPACE_END
#endif
|
