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
|
// 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 "vtkDirectedGraph.h"
#include "vtkInEdgeIterator.h"
#include "vtkInformation.h"
#include "vtkInformationVector.h"
#include "vtkObjectFactory.h"
#include "vtkOutEdgeIterator.h"
#include "vtkSmartPointer.h"
#include <vector>
//------------------------------------------------------------------------------
// class vtkDirectedGraph
//------------------------------------------------------------------------------
VTK_ABI_NAMESPACE_BEGIN
vtkStandardNewMacro(vtkDirectedGraph);
//------------------------------------------------------------------------------
vtkDirectedGraph::vtkDirectedGraph() = default;
//------------------------------------------------------------------------------
vtkDirectedGraph::~vtkDirectedGraph() = default;
//------------------------------------------------------------------------------
vtkDirectedGraph* vtkDirectedGraph::GetData(vtkInformation* info)
{
return info ? vtkDirectedGraph::SafeDownCast(info->Get(DATA_OBJECT())) : nullptr;
}
//------------------------------------------------------------------------------
vtkDirectedGraph* vtkDirectedGraph::GetData(vtkInformationVector* v, int i)
{
return vtkDirectedGraph::GetData(v->GetInformationObject(i));
}
//------------------------------------------------------------------------------
bool vtkDirectedGraph::IsStructureValid(vtkGraph* g)
{
if (!g)
{
return false;
}
if (vtkDirectedGraph::SafeDownCast(g))
{
return true;
}
// Verify that each edge appears in exactly one in and one out edge list.
std::vector<bool> in(g->GetNumberOfEdges(), false);
std::vector<bool> out(g->GetNumberOfEdges(), false);
vtkSmartPointer<vtkInEdgeIterator> inIter = vtkSmartPointer<vtkInEdgeIterator>::New();
vtkSmartPointer<vtkOutEdgeIterator> outIter = vtkSmartPointer<vtkOutEdgeIterator>::New();
for (vtkIdType v = 0; v < g->GetNumberOfVertices(); ++v)
{
g->GetInEdges(v, inIter);
while (inIter->HasNext())
{
vtkIdType id = inIter->Next().Id;
if (in[id])
{
return false;
}
in[id] = true;
}
g->GetOutEdges(v, outIter);
while (outIter->HasNext())
{
vtkIdType id = outIter->Next().Id;
if (out[id])
{
return false;
}
out[id] = true;
}
}
for (vtkIdType i = 0; i < g->GetNumberOfEdges(); ++i)
{
if (!in[i] || !out[i])
{
return false;
}
}
return true;
}
//------------------------------------------------------------------------------
void vtkDirectedGraph::PrintSelf(ostream& os, vtkIndent indent)
{
this->Superclass::PrintSelf(os, indent);
}
VTK_ABI_NAMESPACE_END
|
