#include <vtkAdjacencyMatrixToEdgeTable.h>

Inheritance diagram for vtkAdjacencyMatrixToEdgeTable:

Collaboration diagram for vtkAdjacencyMatrixToEdgeTable:

Public Types
typedef vtkTableAlgorithm	Superclass
Public Member Functions
virtual int	IsA (const char *type)
vtkAdjacencyMatrixToEdgeTable *	NewInstance () const
void	PrintSelf (ostream &os, vtkIndent indent)

virtual vtkIdType	GetSourceDimension ()
virtual void	SetSourceDimension (vtkIdType)

virtual char *	GetValueArrayName ()
virtual void	SetValueArrayName (const char *)

virtual vtkIdType	GetMinimumCount ()
virtual void	SetMinimumCount (vtkIdType)

virtual double	GetMinimumThreshold ()
virtual void	SetMinimumThreshold (double)
Static Public Member Functions
static vtkAdjacencyMatrixToEdgeTable *	New ()
static int	IsTypeOf (const char *type)
static vtkAdjacencyMatrixToEdgeTable *	SafeDownCast (vtkObjectBase *o)
Protected Member Functions
virtual vtkObjectBase *	NewInstanceInternal () const
	vtkAdjacencyMatrixToEdgeTable ()
	~vtkAdjacencyMatrixToEdgeTable ()
int	FillInputPortInformation (int, vtkInformation *)
int	RequestData (vtkInformation , vtkInformationVector , vtkInformationVector )
Protected Attributes
vtkIdType	SourceDimension
char *	ValueArrayName
vtkIdType	MinimumCount
double	MinimumThreshold

Detailed Description

Treats a dense 2-way array of doubles as an adacency matrix and converts it into a vtkTable suitable for use as an edge table with vtkTableToGraph.

Thanks:: Developed by Timothy M. Shead (tshea.nosp@m.d@sa.nosp@m.ndia..nosp@m.gov) at Sandia National Laboratories.

Events:: vtkCommand::ProgressEvent

Examples:: vtkAdjacencyMatrixToEdgeTable (Examples)

Definition at line 44 of file vtkAdjacencyMatrixToEdgeTable.h.

Member Typedef Documentation

typedef vtkTableAlgorithm vtkAdjacencyMatrixToEdgeTable::Superclass

Reimplemented from vtkTableAlgorithm.

Definition at line 48 of file vtkAdjacencyMatrixToEdgeTable.h.

Constructor & Destructor Documentation

vtkAdjacencyMatrixToEdgeTable::vtkAdjacencyMatrixToEdgeTable ( ) [protected]

vtkAdjacencyMatrixToEdgeTable::~vtkAdjacencyMatrixToEdgeTable ( ) [protected]

Member Function Documentation

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

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

Reimplemented from vtkTableAlgorithm.

static int vtkAdjacencyMatrixToEdgeTable::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 vtkTableAlgorithm.

virtual int vtkAdjacencyMatrixToEdgeTable::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 vtkTableAlgorithm.

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

Reimplemented from vtkTableAlgorithm.

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

Reimplemented from vtkTableAlgorithm.

vtkAdjacencyMatrixToEdgeTable* vtkAdjacencyMatrixToEdgeTable::NewInstance ( ) const

Reimplemented from vtkTableAlgorithm.

void vtkAdjacencyMatrixToEdgeTable::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 vtkTableAlgorithm.

virtual vtkIdType vtkAdjacencyMatrixToEdgeTable::GetSourceDimension ( ) [virtual]

Specifies whether rows or columns become the "source" in the output edge table. 0 = rows, 1 = columns. Default: 0

virtual void vtkAdjacencyMatrixToEdgeTable::SetSourceDimension ( vtkIdType ) [virtual]

Specifies whether rows or columns become the "source" in the output edge table. 0 = rows, 1 = columns. Default: 0

virtual char* vtkAdjacencyMatrixToEdgeTable::GetValueArrayName ( ) [virtual]

Controls the name of the output table column that contains edge weights. Default: "value"

virtual void vtkAdjacencyMatrixToEdgeTable::SetValueArrayName ( const char * ) [virtual]

Controls the name of the output table column that contains edge weights. Default: "value"

virtual vtkIdType vtkAdjacencyMatrixToEdgeTable::GetMinimumCount ( ) [virtual]

Specifies the minimum number of adjacent edges to include for each source vertex. Default: 0

virtual void vtkAdjacencyMatrixToEdgeTable::SetMinimumCount ( vtkIdType ) [virtual]

Specifies the minimum number of adjacent edges to include for each source vertex. Default: 0

virtual double vtkAdjacencyMatrixToEdgeTable::GetMinimumThreshold ( ) [virtual]

Specifies a minimum threshold that an edge weight must exceed to be included in the output. Default: 0.5

virtual void vtkAdjacencyMatrixToEdgeTable::SetMinimumThreshold ( double ) [virtual]

Specifies a minimum threshold that an edge weight must exceed to be included in the output. Default: 0.5

int vtkAdjacencyMatrixToEdgeTable::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 vtkTableAlgorithm.

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