combines two graphs More...

#include <vtkMergeGraphs.h>

Inheritance diagram for vtkMergeGraphs:

Collaboration diagram for vtkMergeGraphs:

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

Detailed Description

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:

vertices in the second graph whose pedigree id does not match a vertex in the first input

edges in the second graph

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.

Warning:: This filter is not "domain-aware". Pedigree ids are assumed to be globally unique, regardless of their domain.

Examples:: vtkMergeGraphs (Examples)

Tests:: vtkMergeGraphs (Tests)

Definition at line 63 of file vtkMergeGraphs.h.

Member Typedef Documentation

typedef vtkGraphAlgorithm vtkMergeGraphs::Superclass

Reimplemented from vtkGraphAlgorithm.

Definition at line 67 of file vtkMergeGraphs.h.

Constructor & Destructor Documentation

vtkMergeGraphs::vtkMergeGraphs ( ) [protected]

vtkMergeGraphs::~vtkMergeGraphs ( ) [protected]

Member Function Documentation

static vtkMergeGraphs* vtkMergeGraphs::New ( ) [static]

Create an object with Debug turned off, modified time initialized to zero, and reference counting on.

Reimplemented from vtkGraphAlgorithm.

static int vtkMergeGraphs::IsTypeOf ( const char * name ) [static]

Return 1 if this class type is the same type of (or a subclass of) the named class. Returns 0 otherwise. This method works in combination with vtkTypeMacro found in vtkSetGet.h.

Reimplemented from vtkGraphAlgorithm.

virtual int vtkMergeGraphs::IsA ( const char * name ) [virtual]

Return 1 if this class is the same type of (or a subclass of) the named class. Returns 0 otherwise. This method works in combination with vtkTypeMacro found in vtkSetGet.h.

Reimplemented from vtkGraphAlgorithm.

static vtkMergeGraphs* vtkMergeGraphs::SafeDownCast ( vtkObjectBase * o ) [static]

Reimplemented from vtkGraphAlgorithm.

virtual vtkObjectBase* vtkMergeGraphs::NewInstanceInternal ( ) const [protected, virtual]

Reimplemented from vtkGraphAlgorithm.

vtkMergeGraphs* vtkMergeGraphs::NewInstance ( ) const

Reimplemented from vtkGraphAlgorithm.

void vtkMergeGraphs::PrintSelf	(	ostream &	os,
		vtkIndent	indent
	)		`[virtual]`

Methods invoked by print to print information about the object including superclasses. Typically not called by the user (use Print() instead) but used in the hierarchical print process to combine the output of several classes.

Reimplemented from vtkGraphAlgorithm.

int vtkMergeGraphs::ExtendGraph	(	vtkMutableGraphHelper *	g1,
		vtkGraph *	g2
	)

This is the core functionality of the algorithm. Adds edges and vertices from g2 into g1.

virtual void vtkMergeGraphs::SetUseEdgeWindow ( bool ) [virtual]

Whether to use an edge window array. The default is to not use a window array.

virtual bool vtkMergeGraphs::GetUseEdgeWindow ( ) [virtual]

Whether to use an edge window array. The default is to not use a window array.

virtual void vtkMergeGraphs::UseEdgeWindowOn ( ) [virtual]

Whether to use an edge window array. The default is to not use a window array.

virtual void vtkMergeGraphs::UseEdgeWindowOff ( ) [virtual]

Whether to use an edge window array. The default is to not use a window array.

virtual void vtkMergeGraphs::SetEdgeWindowArrayName ( const char * ) [virtual]

The edge window array. The default array name is "time".

virtual char* vtkMergeGraphs::GetEdgeWindowArrayName ( ) [virtual]

The edge window array. The default array name is "time".

virtual void vtkMergeGraphs::SetEdgeWindow ( double ) [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 double vtkMergeGraphs::GetEdgeWindow ( ) [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 int vtkMergeGraphs::RequestData	(	vtkInformation *	request,
		vtkInformationVector **	inputVector,
		vtkInformationVector *	outputVector
	)		`[protected, virtual]`

This is called by the superclass. This is the method you should override.

Reimplemented from vtkGraphAlgorithm.

virtual int vtkMergeGraphs::FillInputPortInformation	(	int	port,
		vtkInformation *	info
	)		`[protected, virtual]`

Fill the input port information objects for this algorithm. This is invoked by the first call to GetInputPortInformation for each port so subclasses can specify what they can handle.

Reimplemented from vtkGraphAlgorithm.