forked from Kitware/VTK
-
Notifications
You must be signed in to change notification settings - Fork 0
/
vtkBoostPrimMinimumSpanningTree.cxx
308 lines (262 loc) · 9.38 KB
/
vtkBoostPrimMinimumSpanningTree.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
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
/*=========================================================================
Program: Visualization Toolkit
Module: vtkBoostPrimMinimumSpanningTree.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 "vtkBoostPrimMinimumSpanningTree.h"
#include "vtkBoostGraphAdapter.h"
#include "vtkCellArray.h"
#include "vtkCellData.h"
#include "vtkMath.h"
#include "vtkIdTypeArray.h"
#include "vtkInformation.h"
#include "vtkInformationVector.h"
#include "vtkObjectFactory.h"
#include "vtkPointData.h"
#include "vtkPoints.h"
#include "vtkFloatArray.h"
#include "vtkDataArray.h"
#include "vtkSelection.h"
#include "vtkSmartPointer.h"
#include "vtkStringArray.h"
#include "vtkMutableDirectedGraph.h"
#include "vtkUndirectedGraph.h"
#include "vtkTree.h"
#include <boost/graph/prim_minimum_spanning_tree.hpp>
#include <boost/pending/queue.hpp>
using namespace boost;
vtkStandardNewMacro(vtkBoostPrimMinimumSpanningTree);
// Constructor/Destructor
vtkBoostPrimMinimumSpanningTree::vtkBoostPrimMinimumSpanningTree()
{
this->EdgeWeightArrayName = 0;
this->OriginVertexIndex = 0;
this->ArrayName = 0;
this->SetArrayName("Not Set");
this->ArrayNameSet = false;
this->NegateEdgeWeights = false;
this->EdgeWeightMultiplier = 1;
this->OriginValue = 0;
this->CreateGraphVertexIdArray = false;
}
//----------------------------------------------------------------------------
vtkBoostPrimMinimumSpanningTree::~vtkBoostPrimMinimumSpanningTree()
{
this->SetEdgeWeightArrayName(0);
this->SetArrayName(0);
}
// Description:
// Set the index (into the vertex array) of the
// breadth first search 'origin' vertex.
void vtkBoostPrimMinimumSpanningTree::SetOriginVertex(vtkIdType index)
{
this->OriginVertexIndex = index;
this->Modified();
}
// Description:
// Set the breadth first search 'origin' vertex.
// This method is basically the same as above
// but allows the application to simply specify
// an array name and value, instead of having to
// know the specific index of the vertex.
void vtkBoostPrimMinimumSpanningTree::SetOriginVertex(
vtkStdString arrayName, vtkVariant value)
{
this->SetArrayName(arrayName);
this->ArrayNameSet = true;
this->OriginValue = value;
this->Modified();
}
void vtkBoostPrimMinimumSpanningTree::SetNegateEdgeWeights(bool value)
{
this->NegateEdgeWeights = value;
if (this->NegateEdgeWeights)
{
vtkWarningMacro("The Boost implementation of Prim's minimum spanning tree algorithm does not allow negation of edge weights.");
return;
//this->EdgeWeightMultiplier = -1.0;
}
else
this->EdgeWeightMultiplier = 1.0;
this->Modified();
}
//----------------------------------------------------------------------------
vtkIdType vtkBoostPrimMinimumSpanningTree::GetVertexIndex(
vtkAbstractArray *abstract, vtkVariant value)
{
// Okay now what type of array is it
if (abstract->IsNumeric())
{
vtkDataArray *dataArray = vtkArrayDownCast<vtkDataArray>(abstract);
int intValue = value.ToInt();
for(int i=0; i<dataArray->GetNumberOfTuples(); ++i)
{
if (intValue == static_cast<int>(dataArray->GetTuple1(i)))
{
return i;
}
}
}
else
{
vtkStringArray *stringArray = vtkArrayDownCast<vtkStringArray>(abstract);
vtkStdString stringValue(value.ToString());
for(int i=0; i<stringArray->GetNumberOfTuples(); ++i)
{
if (stringValue == stringArray->GetValue(i))
{
return i;
}
}
}
// Failed
vtkErrorMacro("Did not find a valid vertex index...");
return 0;
}
//----------------------------------------------------------------------------
int vtkBoostPrimMinimumSpanningTree::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 output
vtkGraph *input = vtkGraph::SafeDownCast(
inInfo->Get(vtkDataObject::DATA_OBJECT()));
// Now figure out the origin vertex of the MST
if (this->ArrayNameSet)
{
vtkAbstractArray* abstract = input->GetVertexData()->GetAbstractArray(this->ArrayName);
// Does the array exist at all?
if (abstract == nullptr)
{
vtkErrorMacro("Could not find array named " << this->ArrayName);
return 0;
}
this->OriginVertexIndex = this->GetVertexIndex(abstract,this->OriginValue);
}
// Retrieve the edge-weight array.
if (!this->EdgeWeightArrayName)
{
vtkErrorMacro("Edge-weight array name is required");
return 0;
}
vtkDataArray* edgeWeightArray = input->GetEdgeData()->GetArray(this->EdgeWeightArrayName);
// Does the edge-weight array exist at all?
if (edgeWeightArray == nullptr)
{
vtkErrorMacro("Could not find edge-weight array named "
<< this->EdgeWeightArrayName);
return 0;
}
// Create the mutable graph to build the tree
vtkSmartPointer<vtkMutableDirectedGraph> temp =
vtkSmartPointer<vtkMutableDirectedGraph>::New();
// Initialize copying data into tree
temp->GetFieldData()->PassData(input->GetFieldData());
temp->GetVertexData()->PassData(input->GetVertexData());
temp->GetPoints()->ShallowCopy(input->GetPoints());
//FIXME - We're not copying the edge data, see FIXME note below.
// temp->GetEdgeData()->CopyAllocate(input->GetEdgeData());
// Send the property map through both the multiplier and the
// helper (for edge_descriptor indexing)
typedef vtkGraphPropertyMapMultiplier<vtkDataArray*> mapMulti;
mapMulti multi(edgeWeightArray,this->EdgeWeightMultiplier);
vtkGraphEdgePropertyMapHelper<mapMulti> weight_helper(multi);
// Create a predecessorMap
vtkIdTypeArray* predecessorMap = vtkIdTypeArray::New();
// Run the algorithm
if (vtkDirectedGraph::SafeDownCast(input))
{
vtkDirectedGraph *g = vtkDirectedGraph::SafeDownCast(input);
prim_minimum_spanning_tree(g, predecessorMap, weight_map(weight_helper).root_vertex(this->OriginVertexIndex) );
}
else
{
vtkUndirectedGraph *g = vtkUndirectedGraph::SafeDownCast(input);
prim_minimum_spanning_tree(g, predecessorMap, weight_map(weight_helper).root_vertex(this->OriginVertexIndex) );
}
vtkIdType i;
if ( temp->SetNumberOfVertices( input->GetNumberOfVertices() ) < 0 )
{ // The graph must be distributed.
vtkErrorMacro( "Prim MST algorithm will not work on distributed graphs." );
return 0;
}
for( i = 0; i < temp->GetNumberOfVertices(); i++ )
{
if( predecessorMap->GetValue(i) == i )
{
if( i == this->OriginVertexIndex )
{
continue;
}
else
{
vtkErrorMacro("Unexpected result: MST is a forest (collection of trees).");
return 0;
}
}
temp->AddEdge( predecessorMap->GetValue(i), i );
//FIXME - We're not copying the edge data from the graph to the MST because
// of the ambiguity associated with copying data when parallel edges between
// vertices in the original graph exist.
// temp->GetEdgeData()->CopyData(input->GetEdgeData(), e.Id, tree_e.Id);
}
if (this->CreateGraphVertexIdArray)
{
predecessorMap->SetName("predecessorMap");
temp->GetVertexData()->AddArray(predecessorMap);
}
// Copy the builder graph structure into the output tree
vtkTree *output = vtkTree::SafeDownCast(
outInfo->Get(vtkDataObject::DATA_OBJECT()));
if (!output->CheckedShallowCopy(temp))
{
vtkErrorMacro(<<"Invalid tree.");
return 0;
}
predecessorMap->Delete();
return 1;
}
//----------------------------------------------------------------------------
int vtkBoostPrimMinimumSpanningTree::FillInputPortInformation(
int port, vtkInformation* info)
{
// now add our info
if (port == 0)
{
info->Set(vtkAlgorithm::INPUT_REQUIRED_DATA_TYPE(), "vtkGraph");
}
return 1;
}
//----------------------------------------------------------------------------
void vtkBoostPrimMinimumSpanningTree::PrintSelf(ostream& os, vtkIndent indent)
{
this->Superclass::PrintSelf(os, indent);
os << indent << "OriginVertexIndex: " << this->OriginVertexIndex << endl;
os << indent << "ArrayName: "
<< (this->ArrayName ? this->ArrayName : "(none)") << endl;
os << indent << "OriginValue: " << this->OriginValue.ToString() << endl;
os << indent << "ArrayNameSet: "
<< (this->ArrayNameSet ? "true" : "false") << endl;
os << indent << "NegateEdgeWeights: "
<< (this->NegateEdgeWeights ? "true" : "false") << endl;
os << indent << "EdgeWeightMultiplier: " << this->EdgeWeightMultiplier << endl;
os << indent << "CreateGraphVertexIdArray: "
<< (this->CreateGraphVertexIdArray ? "on" : "off") << endl;
os << indent << "EdgeWeightArrayName: "
<< (this->EdgeWeightArrayName ? this->EdgeWeightArrayName : "(none)")
<< endl;
}