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
|
/*=========================================================================
Program: Visualization Toolkit
Module: TestRemoveIsolatedVertices.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 2008 Sandia Corporation.
Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
the U.S. Government retains certain rights in this software.
-------------------------------------------------------------------------*/
#include <vtkSmartPointer.h>
#include <vtkMutableUndirectedGraph.h>
#include <vtkRemoveIsolatedVertices.h>
int TestRemoveIsolatedVertices(int, char *[])
{
vtkSmartPointer<vtkMutableUndirectedGraph> g =
vtkSmartPointer<vtkMutableUndirectedGraph>::New();
// Create 3 vertices
vtkIdType v1 = g->AddVertex();
vtkIdType v2 = g->AddVertex();
g->AddVertex();
g->AddEdge ( v1, v2 );
vtkSmartPointer<vtkRemoveIsolatedVertices> filter =
vtkSmartPointer<vtkRemoveIsolatedVertices>::New();
filter->SetInputData(g);
filter->Update();
if(filter->GetOutput()->GetNumberOfVertices() != 2)
{
std::cerr << "There are " << filter->GetOutput()->GetNumberOfVertices()
<< " vertices but there should be 2." << std::endl;
return EXIT_FAILURE;
}
return EXIT_SUCCESS;
}
|
