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
107
108
109
110
111
112
113
114
115
116
117
118
|
// SPDX-FileCopyrightText: Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
// SPDX-FileCopyrightText: Copyright 2008 Sandia Corporation
// SPDX-License-Identifier: LicenseRef-BSD-3-Clause-Sandia-USGov
#include "vtkUndirectedGraph.h"
#include "vtkInformation.h"
#include "vtkInformationVector.h"
#include "vtkObjectFactory.h"
#include "vtkOutEdgeIterator.h"
#include "vtkSmartPointer.h"
#include <vector>
//------------------------------------------------------------------------------
// class vtkUndirectedGraph
//------------------------------------------------------------------------------
VTK_ABI_NAMESPACE_BEGIN
vtkStandardNewMacro(vtkUndirectedGraph);
//------------------------------------------------------------------------------
vtkUndirectedGraph::vtkUndirectedGraph() = default;
//------------------------------------------------------------------------------
vtkUndirectedGraph::~vtkUndirectedGraph() = default;
//------------------------------------------------------------------------------
void vtkUndirectedGraph::GetInEdges(vtkIdType v, const vtkInEdgeType*& edges, vtkIdType& nedges)
{
const vtkOutEdgeType* outEdges;
this->GetOutEdges(v, outEdges, nedges);
edges = reinterpret_cast<const vtkInEdgeType*>(outEdges);
}
//------------------------------------------------------------------------------
vtkInEdgeType vtkUndirectedGraph::GetInEdge(vtkIdType v, vtkIdType i)
{
vtkOutEdgeType oe = this->GetOutEdge(v, i);
vtkInEdgeType ie(oe.Target, oe.Id);
return ie;
}
//------------------------------------------------------------------------------
vtkIdType vtkUndirectedGraph::GetInDegree(vtkIdType v)
{
return this->GetOutDegree(v);
}
//------------------------------------------------------------------------------
vtkUndirectedGraph* vtkUndirectedGraph::GetData(vtkInformation* info)
{
return info ? vtkUndirectedGraph::SafeDownCast(info->Get(DATA_OBJECT())) : nullptr;
}
//------------------------------------------------------------------------------
vtkUndirectedGraph* vtkUndirectedGraph::GetData(vtkInformationVector* v, int i)
{
return vtkUndirectedGraph::GetData(v->GetInformationObject(i));
}
//------------------------------------------------------------------------------
bool vtkUndirectedGraph::IsStructureValid(vtkGraph* g)
{
if (!g)
{
return false;
}
if (vtkUndirectedGraph::SafeDownCast(g))
{
return true;
}
// Verify that there are no in edges and that each edge
// appears in exactly two edge lists.
// Loop edges should be in exactly one edge list.
std::vector<vtkIdType> place(g->GetNumberOfEdges(), -1);
std::vector<vtkIdType> count(g->GetNumberOfEdges(), 0);
vtkSmartPointer<vtkOutEdgeIterator> outIter = vtkSmartPointer<vtkOutEdgeIterator>::New();
for (vtkIdType v = 0; v < g->GetNumberOfVertices(); ++v)
{
if (g->GetInDegree(v) > 0)
{
return false;
}
g->GetOutEdges(v, outIter);
while (outIter->HasNext())
{
vtkOutEdgeType e = outIter->Next();
if (place[e.Id] == v)
{
return false;
}
place[e.Id] = v;
count[e.Id]++;
// Count loops twice so they should all have count == 2
if (v == e.Target)
{
count[e.Id]++;
}
}
}
for (vtkIdType i = 0; i < g->GetNumberOfEdges(); ++i)
{
if (count[i] != 2)
{
return false;
}
}
return true;
}
//------------------------------------------------------------------------------
void vtkUndirectedGraph::PrintSelf(ostream& os, vtkIndent indent)
{
this->Superclass::PrintSelf(os, indent);
}
VTK_ABI_NAMESPACE_END
|
