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
|
/*=========================================================================
Program: Visualization Toolkit
Module: vtkGraphInternals.cxx
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.
----------------------------------------------------------------------------*/
#include "vtkGraphInternals.h"
#include "vtkDistributedGraphHelper.h"
#include "vtkObjectFactory.h"
vtkStandardNewMacro(vtkGraphInternals);
//----------------------------------------------------------------------------
vtkGraphInternals::vtkGraphInternals()
{
this->NumberOfEdges = 0;
this->LastRemoteEdgeId = -1;
this->UsingPedigreeIds = false;
}
//----------------------------------------------------------------------------
vtkGraphInternals::~vtkGraphInternals()
{
}
//----------------------------------------------------------------------------
void vtkGraphInternals::RemoveEdgeFromOutList(vtkIdType e, std::vector<vtkOutEdgeType>& outEdges)
{
size_t outSize = outEdges.size();
size_t i = 0;
for (; i < outSize; ++i)
{
if (outEdges[i].Id == e)
{
break;
}
}
if (i == outSize)
{
vtkErrorMacro("Could not find edge in source edge list.");
return;
}
outEdges[i] = outEdges[outSize-1];
outEdges.pop_back();
}
//----------------------------------------------------------------------------
void vtkGraphInternals::RemoveEdgeFromInList(vtkIdType e, std::vector<vtkInEdgeType>& inEdges)
{
size_t inSize = inEdges.size();
size_t i = 0;
for (; i < inSize; ++i)
{
if (inEdges[i].Id == e)
{
break;
}
}
if (i == inSize)
{
vtkErrorMacro("Could not find edge in source edge list.");
return;
}
inEdges[i] = inEdges[inSize-1];
inEdges.pop_back();
}
//----------------------------------------------------------------------------
void vtkGraphInternals::ReplaceEdgeFromOutList(vtkIdType from, vtkIdType to, std::vector<vtkOutEdgeType>& outEdges)
{
size_t outSize = outEdges.size();
for (size_t i = 0; i < outSize; ++i)
{
if (outEdges[i].Id == from)
{
outEdges[i].Id = to;
}
}
}
//----------------------------------------------------------------------------
void vtkGraphInternals::ReplaceEdgeFromInList(vtkIdType from, vtkIdType to, std::vector<vtkInEdgeType>& inEdges)
{
size_t inSize = inEdges.size();
for (size_t i = 0; i < inSize; ++i)
{
if (inEdges[i].Id == from)
{
inEdges[i].Id = to;
}
}
}
|
