forked from Kitware/VTK
-
Notifications
You must be signed in to change notification settings - Fork 0
/
vtkBoostExtractLargestComponent.cxx
163 lines (132 loc) · 5.32 KB
/
vtkBoostExtractLargestComponent.cxx
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
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
/*=========================================================================
Program: Visualization Toolkit
Module: vtkBoostExtractLargestComponent.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 "vtkBoostExtractLargestComponent.h"
#include "vtkBoostConnectedComponents.h"
#include "vtkDataSetAttributes.h"
#include "vtkDirectedGraph.h"
#include "vtkExecutive.h"
#include "vtkExtractSelectedGraph.h"
#include "vtkGraph.h"
#include "vtkIdTypeArray.h"
#include "vtkInformation.h"
#include "vtkInformationVector.h"
#include "vtkIntArray.h"
#include "vtkObjectFactory.h"
#include "vtkSmartPointer.h"
#include "vtkSelection.h"
#include "vtkSelectionNode.h"
#include "vtkUndirectedGraph.h"
#include <algorithm>
vtkStandardNewMacro(vtkBoostExtractLargestComponent);
vtkBoostExtractLargestComponent::vtkBoostExtractLargestComponent()
{
this->InvertSelection = false;
}
int vtkBoostExtractLargestComponent::RequestData(vtkInformation *vtkNotUsed(request),
vtkInformationVector **inputVector,
vtkInformationVector *outputVector)
{
// Get the info objects
vtkInformation *inInfo = inputVector[0]->GetInformationObject(0);
vtkInformation *outInfo = outputVector->GetInformationObject(0);
// Get the input and ouptut
vtkGraph* input = vtkGraph::SafeDownCast(
inInfo->Get(vtkDataObject::DATA_OBJECT()));
vtkGraph* output = vtkGraph::SafeDownCast(
outInfo->Get(vtkDataObject::DATA_OBJECT()));
vtkSmartPointer<vtkGraph> inputCopy;
if (vtkDirectedGraph::SafeDownCast(input))
{
inputCopy = vtkSmartPointer<vtkDirectedGraph>::New();
}
else
{
inputCopy = vtkSmartPointer<vtkUndirectedGraph>::New();
}
inputCopy->ShallowCopy(input);
// Find all of the connected components
vtkSmartPointer<vtkBoostConnectedComponents> connectedComponents =
vtkSmartPointer<vtkBoostConnectedComponents>::New();
connectedComponents->SetInputData(inputCopy);
connectedComponents->Update();
vtkIntArray* components = vtkIntArray::SafeDownCast(
connectedComponents->GetOutput()->GetVertexData()->GetArray("component"));
// Create an array to store the count of the number of vertices
// in every component
int componentRange[2];
components->GetValueRange(componentRange);
std::vector<int> componentCount(componentRange[1] + 1);
for(vtkIdType i = 0; i < components->GetNumberOfTuples(); i++)
{
componentCount[components->GetValue(i)]++;
}
// Save the original counts
std::vector<int> originalComponentCount(componentCount.size());
std::copy(componentCount.begin(), componentCount.end(), originalComponentCount.begin());
// Sort in descending order
std::sort(componentCount.rbegin(), componentCount.rend());
// Find the original component ID of the component with the highest count
std::vector<int>::iterator it = find(originalComponentCount.begin(),
originalComponentCount.end(), componentCount[0]);
if(it == originalComponentCount.end())
{
vtkErrorMacro("Should never get to the end of the components!");
return 0;
}
int largestComponent = it - originalComponentCount.begin();
vtkDebugMacro("The largest component is " << largestComponent
<< " and it has " << componentCount[0] << " vertices.");
// Put either the index of the vertices belonging to the largest connected component
// or the index of the vertices NOT the largest connected component (depending on the
// InververtSelection flag) into an array to be used to extract this part of the graph.
vtkSmartPointer<vtkIdTypeArray> ids =
vtkSmartPointer<vtkIdTypeArray>::New();
for(vtkIdType i = 0; i < components->GetNumberOfTuples(); i++)
{
if(!this->InvertSelection)
{
if(components->GetValue(i) == largestComponent)
{
ids->InsertNextValue(i);
}
}
else
{
if(components->GetValue(i) != largestComponent)
{
ids->InsertNextValue(i);
}
}
}
vtkDebugMacro(<< ids->GetNumberOfTuples() << " values selected.");
// Mark all of the things in the graph that should be extracted
vtkSmartPointer<vtkSelection> selection =
vtkSmartPointer<vtkSelection>::New();
vtkSmartPointer<vtkSelectionNode> node =
vtkSmartPointer<vtkSelectionNode>::New();
selection->AddNode(node);
node->SetSelectionList(ids);
node->SetContentType(vtkSelectionNode::INDICES);
node->SetFieldType(vtkSelectionNode::VERTEX);
// Extract them
vtkSmartPointer<vtkExtractSelectedGraph> extractSelectedGraph =
vtkSmartPointer<vtkExtractSelectedGraph>::New();
extractSelectedGraph->SetInputData(0, inputCopy);
extractSelectedGraph->SetInputData(1, selection);
extractSelectedGraph->Update();
output->ShallowCopy(extractSelectedGraph->GetOutput());
return 1;
}
void vtkBoostExtractLargestComponent::PrintSelf(ostream& os, vtkIndent indent)
{
this->Superclass::PrintSelf(os,indent);
os << indent << "InvertSelection: " << this->InvertSelection << "\n";
}