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
|
/*=========================================================================
Program: Visualization Toolkit
Module: vtkExpandSelectedGraph.h
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.
-------------------------------------------------------------------------*/
// .NAME vtkExpandSelectedGraph - expands a selection set of a vtkGraph
//
// .SECTION Description
// The first input is a vtkSelection containing the selected vertices.
// The second input is a vtkGraph.
// This filter 'grows' the selection set in one of the following ways
// 1) SetBFSDistance controls how many 'hops' the selection is grown
// from each seed point in the selection set (defaults to 1)
// 2) IncludeShortestPaths controls whether this filter tries to
// 'connect' the vertices in the selection set by computing the
// shortest path between the vertices (if such a path exists)
// Note: IncludeShortestPaths is currently non-functional
#ifndef vtkExpandSelectedGraph_h
#define vtkExpandSelectedGraph_h
#include "vtkInfovisCoreModule.h" // For export macro
#include "vtkSelectionAlgorithm.h"
class vtkGraph;
class vtkIdTypeArray;
class VTKINFOVISCORE_EXPORT vtkExpandSelectedGraph : public vtkSelectionAlgorithm
{
public:
static vtkExpandSelectedGraph* New();
vtkTypeMacro(vtkExpandSelectedGraph,vtkSelectionAlgorithm);
void PrintSelf(ostream& os, vtkIndent indent);
// Description:
// A convenience method for setting the second input (i.e. the graph).
void SetGraphConnection(vtkAlgorithmOutput* in);
// Description:
// Specify the first vtkSelection input and the second vtkGraph input.
int FillInputPortInformation(int port, vtkInformation* info);
// Description:
// Set/Get BFSDistance which controls how many 'hops' the selection
// is grown from each seed point in the selection set (defaults to 1)
vtkSetMacro(BFSDistance, int);
vtkGetMacro(BFSDistance, int);
// Description:
// Set/Get IncludeShortestPaths controls whether this filter tries to
// 'connect' the vertices in the selection set by computing the
// shortest path between the vertices (if such a path exists)
// Note: IncludeShortestPaths is currently non-functional
vtkSetMacro(IncludeShortestPaths, bool);
vtkGetMacro(IncludeShortestPaths, bool);
vtkBooleanMacro(IncludeShortestPaths, bool);
// Description:
// Set/Get the vertex domain to use in the expansion.
vtkSetStringMacro(Domain);
vtkGetStringMacro(Domain);
// Description:
// Whether or not to use the domain when deciding to add a vertex to the
// expansion. Defaults to false.
vtkSetMacro(UseDomain, bool);
vtkGetMacro(UseDomain, bool);
vtkBooleanMacro(UseDomain, bool);
protected:
vtkExpandSelectedGraph();
~vtkExpandSelectedGraph();
int RequestData(
vtkInformation*,
vtkInformationVector**,
vtkInformationVector*);
void Expand(vtkIdTypeArray*,vtkGraph*);
int BFSDistance;
bool IncludeShortestPaths;
char* Domain;
bool UseDomain;
private:
vtkExpandSelectedGraph(const vtkExpandSelectedGraph&); // Not implemented
void operator=(const vtkExpandSelectedGraph&); // Not implemented
void BFSExpandSelection(vtkIdTypeArray *selection,
vtkGraph *graph);
};
#endif
|
