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: vtkInEdgeIterator.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.
-------------------------------------------------------------------------*/
// .NAME vtkInEdgeIterator - Iterates through all incoming edges to a vertex.
//
// .SECTION Description
// vtkInEdgeIterator iterates through all edges whose target is a particular
// vertex. Instantiate this class directly and call Initialize() to traverse
// the vertex of a graph. Alternately, use GetInEdges() on the graph to
// initialize the iterator. it->Next() returns a vtkInEdgeType structure,
// which contains Id, the edge's id, and Source, the edge's source vertex.
//
// .SECTION See Also
// vtkGraph vtkOutEdgeIterator
#ifndef vtkInEdgeIterator_h
#define vtkInEdgeIterator_h
#include "vtkCommonDataModelModule.h" // For export macro
#include "vtkObject.h"
#include "vtkGraph.h" // For edge type definitions
class vtkGraphEdge;
class VTKCOMMONDATAMODEL_EXPORT vtkInEdgeIterator : public vtkObject
{
public:
static vtkInEdgeIterator *New();
vtkTypeMacro(vtkInEdgeIterator, vtkObject);
void PrintSelf(ostream& os, vtkIndent indent);
// Description:
// Initialize the iterator with a graph and vertex.
void Initialize(vtkGraph *g, vtkIdType v);
// Description:
// Get the graph and vertex associated with this iterator.
vtkGetObjectMacro(Graph, vtkGraph);
vtkGetMacro(Vertex, vtkIdType);
//BTX
// Description:
// Returns the next edge in the graph.
inline vtkInEdgeType Next()
{
vtkInEdgeType e = *this->Current;
++this->Current;
return e;
}
//ETX
// Description:
// Just like Next(), but
// returns heavy-weight vtkGraphEdge object instead of
// the vtkEdgeType struct, for use with wrappers.
// The graph edge is owned by this iterator, and changes
// after each call to NextGraphEdge().
vtkGraphEdge *NextGraphEdge();
// Description:
// Whether this iterator has more edges.
bool HasNext()
{
return this->Current != this->End;
}
protected:
vtkInEdgeIterator();
~vtkInEdgeIterator();
// Description:
// Protected method for setting the graph used
// by Initialize().
virtual void SetGraph(vtkGraph *graph);
vtkGraph *Graph;
const vtkInEdgeType *Current;
const vtkInEdgeType *End;
vtkIdType Vertex;
vtkGraphEdge *GraphEdge;
private:
vtkInEdgeIterator(const vtkInEdgeIterator&); // Not implemented.
void operator=(const vtkInEdgeIterator&); // Not implemented.
};
#endif
|
