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
105
106
|
/*=========================================================================
Program: Visualization Toolkit
Module: vtkGraphInternals.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 (c) Sandia Corporation
See Copyright.txt or http://www.paraview.org/HTML/Copyright.html for details.
----------------------------------------------------------------------------*/
/**
* @class vtkGraphInternals
* @brief Internal representation of vtkGraph
*
*
* This is the internal representation of vtkGraph, used only in rare cases
* where one must modify that representation.
*/
#ifndef vtkGraphInternals_h
#define vtkGraphInternals_h
#include "vtkCommonDataModelModule.h" // For export macro
#include "vtkGraph.h" // For edge types
#include "vtkObject.h"
#include <map> // STL Header
#include <vector> // STL Header
//----------------------------------------------------------------------------
// class vtkVertexAdjacencyList
//----------------------------------------------------------------------------
VTK_ABI_NAMESPACE_BEGIN
class vtkVertexAdjacencyList
{
public:
std::vector<vtkInEdgeType> InEdges;
std::vector<vtkOutEdgeType> OutEdges;
};
//----------------------------------------------------------------------------
// class vtkGraphInternals
//----------------------------------------------------------------------------
class VTKCOMMONDATAMODEL_EXPORT vtkGraphInternals : public vtkObject
{
public:
static vtkGraphInternals* New();
vtkTypeMacro(vtkGraphInternals, vtkObject);
void PrintSelf(ostream& os, vtkIndent indent) override;
std::vector<vtkVertexAdjacencyList> Adjacency;
vtkIdType NumberOfEdges;
vtkIdType LastRemoteEdgeId;
vtkIdType LastRemoteEdgeSource;
vtkIdType LastRemoteEdgeTarget;
// Whether we have used pedigree IDs to refer to the vertices of the
// graph, e.g., to add edges or vertices. In a distributed graph,
// the pedigree-id interface is mutually exclusive with the
// no-argument AddVertex() function in vtkMutableUndirectedGraph and
// vtkMutableDirectedGraph.
bool UsingPedigreeIds;
/**
* Convenience method for removing an edge from an out edge list.
*/
void RemoveEdgeFromOutList(vtkIdType e, std::vector<vtkOutEdgeType>& outEdges);
/**
* Convenience method for removing an edge from an in edge list.
*/
void RemoveEdgeFromInList(vtkIdType e, std::vector<vtkInEdgeType>& inEdges);
/**
* Convenience method for renaming an edge in an out edge list.
*/
void ReplaceEdgeFromOutList(vtkIdType from, vtkIdType to, std::vector<vtkOutEdgeType>& outEdges);
/**
* Convenience method for renaming an edge in an in edge list.
*/
void ReplaceEdgeFromInList(vtkIdType from, vtkIdType to, std::vector<vtkInEdgeType>& inEdges);
protected:
vtkGraphInternals();
~vtkGraphInternals() override;
private:
vtkGraphInternals(const vtkGraphInternals&) = delete;
void operator=(const vtkGraphInternals&) = delete;
};
VTK_ABI_NAMESPACE_END
#endif // vtkGraphInternals_h
|
