forked from Kitware/VTK
-
Notifications
You must be signed in to change notification settings - Fork 0
/
vtkAdjacentVertexIterator.h
104 lines (86 loc) · 2.75 KB
/
vtkAdjacentVertexIterator.h
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
99
100
101
102
103
104
/*=========================================================================
Program: Visualization Toolkit
Module: vtkAdjacentVertexIterator.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 vtkAdjacentVertexIterator
* @brief Iterates through adjacent vertices in a graph.
*
*
* vtkAdjacentVertexIterator iterates through all vertices adjacent to a
* vertex, i.e. the vertices which may be reached by traversing an out edge
* of the source vertex. Use graph->GetAdjacentVertices(v, it) to initialize
* the iterator.
*
*
*
*/
#ifndef vtkAdjacentVertexIterator_h
#define vtkAdjacentVertexIterator_h
#include "vtkCommonDataModelModule.h" // For export macro
#include "vtkObject.h"
#include "vtkGraph.h" // For edge type definitions
class vtkGraphEdge;
class VTKCOMMONDATAMODEL_EXPORT vtkAdjacentVertexIterator : public vtkObject
{
public:
static vtkAdjacentVertexIterator *New();
vtkTypeMacro(vtkAdjacentVertexIterator, vtkObject);
void PrintSelf(ostream& os, vtkIndent indent) override;
/**
* Initialize the iterator with a graph and vertex.
*/
void Initialize(vtkGraph *g, vtkIdType v);
//@{
/**
* Get the graph and vertex associated with this iterator.
*/
vtkGetObjectMacro(Graph, vtkGraph);
vtkGetMacro(Vertex, vtkIdType);
//@}
//@{
/**
* Returns the next edge in the graph.
*/
vtkIdType Next()
{
vtkOutEdgeType e = *this->Current;
++this->Current;
return e.Target;
}
//@}
/**
* Whether this iterator has more edges.
*/
bool HasNext()
{
return this->Current != this->End;
}
protected:
vtkAdjacentVertexIterator();
~vtkAdjacentVertexIterator() override;
/**
* Protected method for setting the graph used
* by Initialize().
*/
virtual void SetGraph(vtkGraph *graph);
vtkGraph *Graph;
const vtkOutEdgeType *Current;
const vtkOutEdgeType *End;
vtkIdType Vertex;
private:
vtkAdjacentVertexIterator(const vtkAdjacentVertexIterator&) = delete;
void operator=(const vtkAdjacentVertexIterator&) = delete;
};
#endif