forked from Kitware/VTK
-
Notifications
You must be signed in to change notification settings - Fork 0
/
vtkExpandSelectedGraph.cxx
196 lines (171 loc) · 6.09 KB
/
vtkExpandSelectedGraph.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
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
/*=========================================================================
Program: Visualization Toolkit
Module: vtkExpandSelectedGraph.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 (c) Sandia Corporation
See Copyright.txt or http://www.paraview.org/HTML/Copyright.html for details.
----------------------------------------------------------------------------*/
#include "vtkExpandSelectedGraph.h"
#include "vtkCellData.h"
#include "vtkCommand.h"
#include "vtkConvertSelection.h"
#include "vtkDataArray.h"
#include "vtkEventForwarderCommand.h"
#include "vtkExtractSelection.h"
#include "vtkGraph.h"
#include "vtkIdTypeArray.h"
#include "vtkInEdgeIterator.h"
#include "vtkInformation.h"
#include "vtkInformationVector.h"
#include "vtkObjectFactory.h"
#include "vtkOutEdgeIterator.h"
#include "vtkPointData.h"
#include "vtkSelection.h"
#include "vtkSelectionNode.h"
#include "vtkSignedCharArray.h"
#include "vtkSmartPointer.h"
#include "vtkStringArray.h"
#include <set>
#define VTK_CREATE(type, name) vtkSmartPointer<type> name = vtkSmartPointer<type>::New()
vtkStandardNewMacro(vtkExpandSelectedGraph);
vtkExpandSelectedGraph::vtkExpandSelectedGraph()
{
this->SetNumberOfInputPorts(2);
this->BFSDistance = 1;
this->IncludeShortestPaths = false;
this->UseDomain = false;
this->Domain = nullptr;
}
vtkExpandSelectedGraph::~vtkExpandSelectedGraph()
{
this->SetDomain(nullptr);
}
int vtkExpandSelectedGraph::FillInputPortInformation(int port, vtkInformation* info)
{
if (port == 0)
{
info->Set(vtkAlgorithm::INPUT_REQUIRED_DATA_TYPE(), "vtkSelection");
return 1;
}
else if (port == 1)
{
info->Set(vtkAlgorithm::INPUT_REQUIRED_DATA_TYPE(), "vtkGraph");
return 1;
}
return 0;
}
void vtkExpandSelectedGraph::SetGraphConnection(vtkAlgorithmOutput* in)
{
this->SetInputConnection(1, in);
}
int vtkExpandSelectedGraph::RequestData(vtkInformation* vtkNotUsed(request),
vtkInformationVector** inputVector, vtkInformationVector* outputVector)
{
vtkSelection* input = vtkSelection::GetData(inputVector[0]);
vtkGraph* graph = vtkGraph::GetData(inputVector[1]);
vtkSelection* output = vtkSelection::GetData(outputVector);
VTK_CREATE(vtkIdTypeArray, indexArray);
vtkConvertSelection::GetSelectedVertices(input, graph, indexArray);
this->Expand(indexArray, graph);
// TODO: Get rid of this HACK.
// This guarantees we have unique indices.
// vtkConvertSelection should "flatten out" the input selection
// to a single index selection which we then expand, instead of
// expanding each child selection and merging them which creates
// duplicates.
std::set<vtkIdType> indexSet;
for (int i = 0; i < indexArray->GetNumberOfTuples(); ++i)
{
indexSet.insert(indexArray->GetValue(i));
}
// Delete any entries in the current selection list
indexArray->Reset();
// Convert the stl set into the selection list
std::set<vtkIdType>::iterator I;
for (I = indexSet.begin(); I != indexSet.end(); ++I)
{
indexArray->InsertNextValue(*I);
}
// Convert back to a pedigree id selection
VTK_CREATE(vtkSelection, indexSelection);
VTK_CREATE(vtkSelectionNode, node);
indexSelection->AddNode(node);
node->SetSelectionList(indexArray);
node->SetFieldType(vtkSelectionNode::VERTEX);
node->SetContentType(vtkSelectionNode::INDICES);
VTK_CREATE(vtkSelection, pedigreeIdSelection);
pedigreeIdSelection.TakeReference(
vtkConvertSelection::ToPedigreeIdSelection(indexSelection, graph));
output->DeepCopy(pedigreeIdSelection);
return 1;
}
void vtkExpandSelectedGraph::Expand(vtkIdTypeArray* indexArray, vtkGraph* graph)
{
// Now expand the selection to include neighborhoods around
// the selected vertices
int distance = this->BFSDistance;
while (distance > 0)
{
this->BFSExpandSelection(indexArray, graph);
--distance;
}
}
void vtkExpandSelectedGraph::BFSExpandSelection(vtkIdTypeArray* indexArray, vtkGraph* graph)
{
// For each vertex in the selection get its adjacent vertices
VTK_CREATE(vtkInEdgeIterator, inIt);
VTK_CREATE(vtkOutEdgeIterator, outIt);
vtkAbstractArray* domainArr = graph->GetVertexData()->GetAbstractArray("domain");
std::set<vtkIdType> indexSet;
for (int i = 0; i < indexArray->GetNumberOfTuples(); ++i)
{
// First insert myself
indexSet.insert(indexArray->GetValue(i));
// Now insert all adjacent vertices
graph->GetInEdges(indexArray->GetValue(i), inIt);
while (inIt->HasNext())
{
vtkInEdgeType e = inIt->Next();
if (this->UseDomain && this->Domain &&
domainArr->GetVariantValue(e.Source).ToString() != this->Domain)
{
continue;
}
indexSet.insert(e.Source);
}
graph->GetOutEdges(indexArray->GetValue(i), outIt);
while (outIt->HasNext())
{
vtkOutEdgeType e = outIt->Next();
if (this->UseDomain && this->Domain && domainArr &&
domainArr->GetVariantValue(e.Target).ToString() != this->Domain)
{
continue;
}
indexSet.insert(e.Target);
}
}
// Delete any entries in the current selection list
indexArray->Reset();
// Convert the stl set into the selection list
std::set<vtkIdType>::iterator I;
for (I = indexSet.begin(); I != indexSet.end(); ++I)
{
indexArray->InsertNextValue(*I);
}
}
void vtkExpandSelectedGraph::PrintSelf(ostream& os, vtkIndent indent)
{
this->Superclass::PrintSelf(os, indent);
os << indent << "BFSDistance: " << this->BFSDistance << endl;
os << indent << "IncludeShortestPaths: " << (this->IncludeShortestPaths ? "on" : "off") << endl;
os << indent << "Domain: " << (this->Domain ? this->Domain : "(null)") << endl;
os << indent << "UseDomain: " << (this->UseDomain ? "on" : "off") << endl;
}