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
119
|
/*=========================================================================
Program: Visualization Toolkit
Module: TestBooleanOperationPolyDataFilter.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.
=========================================================================*/
#include "vtkDataSetAttributes.h"
#include "vtkDoubleArray.h"
#include "vtkEdgeListIterator.h"
#include "vtkMutableDirectedGraph.h"
#include "vtkPassThrough.h"
#include "vtkSmartPointer.h"
#define VTK_CREATE(type, name) \
vtkSmartPointer<type> name = vtkSmartPointer<type>::New()
bool CompareData(vtkGraph* Output, vtkGraph* Input)
{
bool inputDirected = (vtkDirectedGraph::SafeDownCast(Input) != 0);
bool outputDirected = (vtkDirectedGraph::SafeDownCast(Output) != 0);
if(inputDirected != outputDirected)
{
std::cerr << "Directedness not the same" << std::endl;
return false;
}
if(Input->GetNumberOfVertices() != Output->GetNumberOfVertices())
{
std::cerr << "GetNumberOfVertices not the same" << std::endl;
return false;
}
if(Input->GetNumberOfEdges() != Output->GetNumberOfEdges())
{
std::cerr << "GetNumberOfEdges not the same" << std::endl;
return false;
}
if(Input->GetVertexData()->GetNumberOfArrays() != Output->GetVertexData()->GetNumberOfArrays())
{
std::cerr << "GetVertexData()->GetNumberOfArrays() not the same" << std::endl;
return false;
}
if(Input->GetEdgeData()->GetNumberOfArrays() != Output->GetEdgeData()->GetNumberOfArrays())
{
std::cerr << "GetEdgeData()->GetNumberOfArrays() not the same" << std::endl;
return false;
}
vtkEdgeListIterator *inputEdges = vtkEdgeListIterator::New();
vtkEdgeListIterator *outputEdges = vtkEdgeListIterator::New();
while(inputEdges->HasNext())
{
vtkEdgeType inputEdge = inputEdges->Next();
vtkEdgeType outputEdge = outputEdges->Next();
if(inputEdge.Source != outputEdge.Source)
{
std::cerr << "Input source != output source" << std::endl;
return false;
}
if(inputEdge.Target != outputEdge.Target)
{
std::cerr << "Input target != output target" << std::endl;
return false;
}
}
inputEdges->Delete();
outputEdges->Delete();
return true;
}
int TestPassThrough(int , char* [])
{
std::cerr << "Generating graph ..." << std::endl;
VTK_CREATE(vtkMutableDirectedGraph, g);
VTK_CREATE(vtkDoubleArray, x);
x->SetName("x");
VTK_CREATE(vtkDoubleArray, y);
y->SetName("y");
VTK_CREATE(vtkDoubleArray, z);
z->SetName("z");
for (vtkIdType i = 0; i < 10; ++i)
{
for (vtkIdType j = 0; j < 10; ++j)
{
g->AddVertex();
x->InsertNextValue(i);
y->InsertNextValue(j);
z->InsertNextValue(1);
}
}
g->GetVertexData()->AddArray(x);
g->GetVertexData()->AddArray(y);
g->GetVertexData()->AddArray(z);
std::cerr << "... done" << std::endl;
VTK_CREATE(vtkPassThrough, pass);
pass->SetInputData(g);
pass->Update();
vtkGraph *output = vtkGraph::SafeDownCast(pass->GetOutput());
if (!CompareData(g, output))
{
std::cerr << "ERROR: Graphs not identical!" << std::endl;
return EXIT_FAILURE;
}
return EXIT_SUCCESS;
}
|
