/usr/include/vtk-7.1/vtkTreeDFSIterator.h is in libvtk7-dev 7.1.1+dfsg1-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 | /*=========================================================================
Program: Visualization Toolkit
Module: vtkTreeDFSIterator.h
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
All rights reserved.
See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notice for more information.
=========================================================================*/
/*-------------------------------------------------------------------------
Copyright 2008 Sandia Corporation.
Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
the U.S. Government retains certain rights in this software.
-------------------------------------------------------------------------*/
/**
* @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"
class vtkTreeDFSIteratorInternals;
class vtkIntArray;
class VTKCOMMONDATAMODEL_EXPORT vtkTreeDFSIterator : public vtkTreeIterator
{
public:
static vtkTreeDFSIterator* New();
vtkTypeMacro(vtkTreeDFSIterator, vtkTreeIterator);
void PrintSelf(ostream& os, vtkIndent indent) VTK_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() VTK_OVERRIDE;
void Initialize() VTK_OVERRIDE;
vtkIdType NextInternal() VTK_OVERRIDE;
int Mode;
vtkIdType CurRoot;
vtkTreeDFSIteratorInternals* Internals;
vtkIntArray* Color;
enum ColorType
{
WHITE,
GRAY,
BLACK
};
private:
vtkTreeDFSIterator(const vtkTreeDFSIterator &) VTK_DELETE_FUNCTION;
void operator=(const vtkTreeDFSIterator &) VTK_DELETE_FUNCTION;
};
#endif
|