VTK
|
combines two graphs More...
#include <vtkMergeGraphs.h>
Inherits vtkGraphAlgorithm.
Public Types | |
typedef vtkGraphAlgorithm | Superclass |
Public Member Functions | |
virtual int | IsA (const char *type) |
vtkMergeGraphs * | NewInstance () const |
void | PrintSelf (ostream &os, vtkIndent indent) |
int | ExtendGraph (vtkMutableGraphHelper *g1, vtkGraph *g2) |
virtual void | SetUseEdgeWindow (bool) |
virtual bool | GetUseEdgeWindow () |
virtual void | UseEdgeWindowOn () |
virtual void | UseEdgeWindowOff () |
virtual void | SetEdgeWindowArrayName (const char *) |
virtual char * | GetEdgeWindowArrayName () |
virtual void | SetEdgeWindow (double) |
virtual double | GetEdgeWindow () |
Static Public Member Functions | |
static vtkMergeGraphs * | New () |
static int | IsTypeOf (const char *type) |
static vtkMergeGraphs * | SafeDownCast (vtkObjectBase *o) |
Protected Member Functions | |
virtual vtkObjectBase * | NewInstanceInternal () const |
vtkMergeGraphs () | |
~vtkMergeGraphs () | |
virtual int | RequestData (vtkInformation *, vtkInformationVector **, vtkInformationVector *) |
virtual int | FillInputPortInformation (int port, vtkInformation *info) |
Protected Attributes | |
bool | UseEdgeWindow |
char * | EdgeWindowArrayName |
double | EdgeWindow |
combines two graphs
vtkMergeGraphs combines information from two graphs into one. Both graphs must have pedigree ids assigned to the vertices. The output will contain the vertices/edges in the first graph, in addition to:
The output will contain the same attribute structure as the input; fields associated only with the second input graph will not be passed to the output. When possible, the vertex/edge data for new vertices and edges will be populated with matching attributes on the second graph. To be considered a matching attribute, the array must have the same name, type, and number of components.
Definition at line 63 of file vtkMergeGraphs.h.
typedef vtkGraphAlgorithm vtkMergeGraphs::Superclass |
Definition at line 67 of file vtkMergeGraphs.h.
|
protected |
|
protected |
|
static |
|
static |
|
virtual |
|
static |
|
protectedvirtual |
vtkMergeGraphs* vtkMergeGraphs::NewInstance | ( | ) | const |
void vtkMergeGraphs::PrintSelf | ( | ostream & | os, |
vtkIndent | indent | ||
) |
int vtkMergeGraphs::ExtendGraph | ( | vtkMutableGraphHelper * | g1, |
vtkGraph * | g2 | ||
) |
This is the core functionality of the algorithm. Adds edges and vertices from g2 into g1.
|
virtual |
Whether to use an edge window array. The default is to not use a window array.
|
virtual |
Whether to use an edge window array. The default is to not use a window array.
|
virtual |
Whether to use an edge window array. The default is to not use a window array.
|
virtual |
Whether to use an edge window array. The default is to not use a window array.
|
virtual |
The edge window array. The default array name is "time".
|
virtual |
The edge window array. The default array name is "time".
|
virtual |
The time window amount. Edges with values lower than the maximum value minus this window will be removed from the graph. The default edge window is 10000.
|
virtual |
The time window amount. Edges with values lower than the maximum value minus this window will be removed from the graph. The default edge window is 10000.
|
protectedvirtual |
|
protectedvirtual |
|
protected |
Definition at line 107 of file vtkMergeGraphs.h.
|
protected |
Definition at line 108 of file vtkMergeGraphs.h.
|
protected |
Definition at line 109 of file vtkMergeGraphs.h.