File: vtkTreeDFSIterator.h

package info (click to toggle)
vtk9 9.5.2%2Bdfsg3-6
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 205,984 kB
  • sloc: cpp: 2,336,570; ansic: 327,116; python: 111,200; yacc: 4,104; java: 3,977; sh: 3,032; xml: 2,771; perl: 2,189; lex: 1,787; makefile: 181; javascript: 165; objc: 153; tcl: 59
file content (83 lines) | stat: -rw-r--r-- 2,340 bytes parent folder | download | duplicates (3)
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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
// SPDX-FileCopyrightText: Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
// SPDX-FileCopyrightText: Copyright 2008 Sandia Corporation
// SPDX-License-Identifier: LicenseRef-BSD-3-Clause-Sandia-USGov
/**
 * @class   vtkTreeDFSIterator
 * @brief   depth first iterator through a vtkGraph
 *
 *
 * vtkTreeDFSIterator performs a depth first search traversal of a tree.
 *
 * First, you must set the tree on which you are going to iterate, and then
 * optionally set the starting vertex and mode. The mode is either
 * DISCOVER (default), in which case vertices are visited as they are first
 * reached, or FINISH, in which case vertices are visited when they are
 * done, i.e. all adjacent vertices have been discovered already.
 *
 * 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.
 */

#ifndef vtkTreeDFSIterator_h
#define vtkTreeDFSIterator_h

#include "vtkCommonDataModelModule.h" // For export macro
#include "vtkTreeIterator.h"

VTK_ABI_NAMESPACE_BEGIN
class vtkTreeDFSIteratorInternals;
class vtkIntArray;

class VTKCOMMONDATAMODEL_EXPORT vtkTreeDFSIterator : public vtkTreeIterator
{
public:
  static vtkTreeDFSIterator* New();
  vtkTypeMacro(vtkTreeDFSIterator, vtkTreeIterator);
  void PrintSelf(ostream& os, vtkIndent indent) override;

  enum ModeType
  {
    DISCOVER,
    FINISH
  };

  ///@{
  /**
   * Set the visit mode of the iterator.  Mode can be
   * DISCOVER (0): Order by discovery time
   * FINISH   (1): Order by finish time
   * Default is DISCOVER.
   * Use DISCOVER for top-down algorithms where parents need to be processed before children.
   * Use FINISH for bottom-up algorithms where children need to be processed before parents.
   */
  void SetMode(int mode);
  vtkGetMacro(Mode, int);
  ///@}

protected:
  vtkTreeDFSIterator();
  ~vtkTreeDFSIterator() override;

  void Initialize() override;
  vtkIdType NextInternal() override;

  int Mode;
  vtkIdType CurRoot;
  vtkTreeDFSIteratorInternals* Internals;
  vtkIntArray* Color;

  enum ColorType
  {
    WHITE,
    GRAY,
    BLACK
  };

private:
  vtkTreeDFSIterator(const vtkTreeDFSIterator&) = delete;
  void operator=(const vtkTreeDFSIterator&) = delete;
};

VTK_ABI_NAMESPACE_END
#endif