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
|
/*=========================================================================
Program: Visualization Toolkit
Module: vtkEdgeListIterator.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 vtkEdgeListIterator
* @brief Iterates through all edges in a graph.
*
*
* vtkEdgeListIterator iterates through all the edges in a graph, by traversing
* the adjacency list for each vertex. You may instantiate this class directly
* and call SetGraph() to traverse a certain graph. You may also call the graph's
* GetEdges() method to set up the iterator for a certain graph.
*
* Note that this class does NOT guarantee that the edges will be processed in
* order of their ids (i.e. it will not necessarily return edge 0, then edge 1,
* etc.).
*
* @sa
* vtkGraph
*/
#ifndef vtkEdgeListIterator_h
#define vtkEdgeListIterator_h
#include "vtkCommonDataModelModule.h" // For export macro
#include "vtkObject.h"
class vtkGraph;
class vtkGraphEdge;
struct vtkEdgeType;
struct vtkOutEdgeType;
class VTKCOMMONDATAMODEL_EXPORT vtkEdgeListIterator : public vtkObject
{
public:
static vtkEdgeListIterator *New();
vtkTypeMacro(vtkEdgeListIterator, vtkObject);
void PrintSelf(ostream& os, vtkIndent indent) VTK_OVERRIDE;
vtkGetObjectMacro(Graph, vtkGraph);
virtual void SetGraph(vtkGraph *graph);
/**
* Returns the next edge in the graph.
*/
vtkEdgeType Next();
/**
* 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();
/**
* Whether this iterator has more edges.
*/
bool HasNext();
protected:
vtkEdgeListIterator();
~vtkEdgeListIterator() VTK_OVERRIDE;
void Increment();
vtkGraph *Graph;
const vtkOutEdgeType *Current;
const vtkOutEdgeType *End;
vtkIdType Vertex;
bool Directed;
vtkGraphEdge *GraphEdge;
private:
vtkEdgeListIterator(const vtkEdgeListIterator&) VTK_DELETE_FUNCTION;
void operator=(const vtkEdgeListIterator&) VTK_DELETE_FUNCTION;
};
#endif
|
