VTK
Public Types | Public Member Functions | Static Public Member Functions | Protected Member Functions | Protected Attributes
vtkGraphLayoutFilter Class Reference

nice layout of undirected graphs in 3D More...

#include <vtkGraphLayoutFilter.h>

Inheritance diagram for vtkGraphLayoutFilter:
Inheritance graph
[legend]
Collaboration diagram for vtkGraphLayoutFilter:
Collaboration graph
[legend]

List of all members.

Public Types

typedef vtkPolyDataAlgorithm Superclass

Public Member Functions

virtual int IsA (const char *type)
vtkGraphLayoutFilterNewInstance () const
void PrintSelf (ostream &os, vtkIndent indent)
virtual void SetThreeDimensionalLayout (int)
virtual int GetThreeDimensionalLayout ()
virtual void ThreeDimensionalLayoutOn ()
virtual void ThreeDimensionalLayoutOff ()
virtual void SetGraphBounds (double, double, double, double, double, double)
virtual void SetGraphBounds (double[6])
virtual doubleGetGraphBounds ()
virtual void GetGraphBounds (double data[6])
virtual void SetAutomaticBoundsComputation (int)
virtual int GetAutomaticBoundsComputation ()
virtual void AutomaticBoundsComputationOn ()
virtual void AutomaticBoundsComputationOff ()
virtual void SetMaxNumberOfIterations (int)
virtual int GetMaxNumberOfIterations ()
virtual void SetCoolDownRate (double)
virtual double GetCoolDownRate ()

Static Public Member Functions

static vtkGraphLayoutFilterNew ()
static int IsTypeOf (const char *type)
static vtkGraphLayoutFilterSafeDownCast (vtkObjectBase *o)

Protected Member Functions

virtual vtkObjectBaseNewInstanceInternal () const
 vtkGraphLayoutFilter ()
 ~vtkGraphLayoutFilter ()
int RequestData (vtkInformation *, vtkInformationVector **, vtkInformationVector *)

Protected Attributes

double GraphBounds [6]
int AutomaticBoundsComputation
int MaxNumberOfIterations
double CoolDownRate
int ThreeDimensionalLayout

Detailed Description

nice layout of undirected graphs in 3D

vtkGraphLayoutFilter will reposition a network of nodes, connected by lines or polylines, into a more pleasing arrangement. The class implements a simple force-directed placement algorithm (Fruchterman & Reingold "Graph Drawing by Force-directed Placement" Software-Practice and Experience 21(11) 1991).

The input to the filter is a vtkPolyData representing the undirected graphs. A graph is represented by a set of polylines and/or lines. The output is also a vtkPolyData, where the point positions have been modified. To use the filter, specify whether you wish the layout to occur in 2D or 3D; the bounds in which the graph should lie (note that you can just use automatic bounds computation); and modify the cool down rate (controls the final process of simulated annealing).

Tests:
vtkGraphLayoutFilter (Tests)

Definition at line 42 of file vtkGraphLayoutFilter.h.


Member Typedef Documentation

Reimplemented from vtkPolyDataAlgorithm.

Definition at line 47 of file vtkGraphLayoutFilter.h.


Constructor & Destructor Documentation

Definition at line 92 of file vtkGraphLayoutFilter.h.


Member Function Documentation

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

Reimplemented from vtkPolyDataAlgorithm.

static int vtkGraphLayoutFilter::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 vtkPolyDataAlgorithm.

virtual int vtkGraphLayoutFilter::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 vtkPolyDataAlgorithm.

Reimplemented from vtkPolyDataAlgorithm.

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

Reimplemented from vtkPolyDataAlgorithm.

Reimplemented from vtkPolyDataAlgorithm.

void vtkGraphLayoutFilter::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 vtkPolyDataAlgorithm.

virtual void vtkGraphLayoutFilter::SetGraphBounds ( double  ,
double  ,
double  ,
double  ,
double  ,
double   
) [virtual]

Set / get the region in space in which to place the final graph. The GraphBounds only affects the results if AutomaticBoundsComputation is off.

virtual void vtkGraphLayoutFilter::SetGraphBounds ( double  [6]) [virtual]

Set / get the region in space in which to place the final graph. The GraphBounds only affects the results if AutomaticBoundsComputation is off.

Set / get the region in space in which to place the final graph. The GraphBounds only affects the results if AutomaticBoundsComputation is off.

virtual void vtkGraphLayoutFilter::GetGraphBounds ( double  data[6]) [virtual]

Set / get the region in space in which to place the final graph. The GraphBounds only affects the results if AutomaticBoundsComputation is off.

Turn on/off automatic graph bounds calculation. If this boolean is off, then the manually specified GraphBounds is used. If on, then the input's bounds us used as the graph bounds.

Turn on/off automatic graph bounds calculation. If this boolean is off, then the manually specified GraphBounds is used. If on, then the input's bounds us used as the graph bounds.

Turn on/off automatic graph bounds calculation. If this boolean is off, then the manually specified GraphBounds is used. If on, then the input's bounds us used as the graph bounds.

Turn on/off automatic graph bounds calculation. If this boolean is off, then the manually specified GraphBounds is used. If on, then the input's bounds us used as the graph bounds.

Set/Get the maximum number of iterations to be used. The higher this number, the more iterations through the algorithm is possible, and thus, the more the graph gets modified.

Set/Get the maximum number of iterations to be used. The higher this number, the more iterations through the algorithm is possible, and thus, the more the graph gets modified.

virtual void vtkGraphLayoutFilter::SetCoolDownRate ( double  ) [virtual]

Set/Get the Cool-down rate. The higher this number is, the longer it will take to "cool-down", and thus, the more the graph will be modified.

Set/Get the Cool-down rate. The higher this number is, the longer it will take to "cool-down", and thus, the more the graph will be modified.

int vtkGraphLayoutFilter::RequestData ( vtkInformation request,
vtkInformationVector **  inputVector,
vtkInformationVector outputVector 
) [protected, virtual]

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

Reimplemented from vtkPolyDataAlgorithm.


Member Data Documentation

Definition at line 96 of file vtkGraphLayoutFilter.h.

Definition at line 97 of file vtkGraphLayoutFilter.h.

Definition at line 98 of file vtkGraphLayoutFilter.h.

Definition at line 99 of file vtkGraphLayoutFilter.h.

Definition at line 100 of file vtkGraphLayoutFilter.h.


The documentation for this class was generated from the following file: