vtkMergeGraphs Class Reference
#include <vtkMergeGraphs.h>
Detailed Description
combines two graphsvtkMergeGraphs 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 62 of file vtkMergeGraphs.h.
Public Types | |
| typedef vtkGraphAlgorithm | Superclass |
Public Member Functions | |
| virtual const char * | GetClassName () |
| virtual int | IsA (const char *type) |
| void | PrintSelf (ostream &os, vtkIndent indent) |
| int | ExtendGraph (vtkMutableGraphHelper *g1, vtkGraph *g2) |
| virtual void | SetMaxEdges (vtkIdType) |
| virtual vtkIdType | GetMaxEdges () |
Static Public Member Functions | |
| static vtkMergeGraphs * | New () |
| static int | IsTypeOf (const char *type) |
| static vtkMergeGraphs * | SafeDownCast (vtkObject *o) |
Protected Member Functions | |
| vtkMergeGraphs () | |
| ~vtkMergeGraphs () | |
| virtual int | RequestData (vtkInformation *, vtkInformationVector **, vtkInformationVector *) |
| virtual int | FillInputPortInformation (int port, vtkInformation *info) |
Protected Attributes | |
| vtkIdType | MaxEdges |
Member Typedef Documentation
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.
| virtual const char* vtkMergeGraphs::GetClassName | ( | ) | [virtual] |
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 | ( | vtkObject * | o | ) | [static] |
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::SetMaxEdges | ( | vtkIdType | ) | [virtual] |
The maximum number of edges in the combined graph. Default is -1, which specifies that there should be no limit on the number of edges.
| virtual vtkIdType vtkMergeGraphs::GetMaxEdges | ( | ) | [virtual] |
The maximum number of edges in the combined graph. Default is -1, which specifies that there should be no limit on the number of edges.
| 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.
Member Data Documentation
vtkIdType vtkMergeGraphs::MaxEdges [protected] |
Definition at line 91 of file vtkMergeGraphs.h.
The documentation for this class was generated from the following file:
- dox/Infovis/vtkMergeGraphs.h
