VTK
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
Public Types | Public Member Functions | Static Public Member Functions | Protected Member Functions | List of all members
vtkKCoreDecomposition Class Reference

Compute the k-core decomposition of the input graph. More...

#include <vtkKCoreDecomposition.h>

Inherits vtkGraphAlgorithm.

Public Types

typedef vtkGraphAlgorithm Superclass
 

Public Member Functions

virtual int IsA (const char *type)
 
vtkKCoreDecompositionNewInstance () const
 
void PrintSelf (ostream &os, vtkIndent indent)
 
virtual void SetOutputArrayName (const char *)
 
virtual void SetUseInDegreeNeighbors (bool)
 
virtual bool GetUseInDegreeNeighbors ()
 
virtual void UseInDegreeNeighborsOn ()
 
virtual void UseInDegreeNeighborsOff ()
 
virtual void SetUseOutDegreeNeighbors (bool)
 
virtual bool GetUseOutDegreeNeighbors ()
 
virtual void UseOutDegreeNeighborsOn ()
 
virtual void UseOutDegreeNeighborsOff ()
 
virtual void SetCheckInputGraph (bool)
 
virtual bool GetCheckInputGraph ()
 
virtual void CheckInputGraphOn ()
 
virtual void CheckInputGraphOff ()
 

Static Public Member Functions

static vtkKCoreDecompositionNew ()
 
static int IsTypeOf (const char *type)
 
static vtkKCoreDecompositionSafeDownCast (vtkObjectBase *o)
 

Protected Member Functions

virtual vtkObjectBase * NewInstanceInternal () const
 
 vtkKCoreDecomposition ()
 
 ~vtkKCoreDecomposition ()
 
int RequestData (vtkInformation *, vtkInformationVector **, vtkInformationVector *)
 

Detailed Description

Compute the k-core decomposition of the input graph.

The k-core decomposition is a graph partitioning strategy that is useful for analyzing the structure of large networks. A k-core of a graph G is a maximal connected subgraph of G in which all vertices have degree at least k. The k-core membership for each vertex of the input graph is found on the vertex data of the output graph as an array named 'KCoreDecompositionNumbers' by default. The algorithm used to find the k-cores has O(number of graph edges) running time, and is described in the following reference paper.

An O(m) Algorithm for Cores Decomposition of Networks V. Batagelj, M. Zaversnik, 2001

Thanks:
Thanks to Thomas Otahal from Sandia National Laboratories for providing this implementation.
Examples:
vtkKCoreDecomposition (Examples)
Tests:
vtkKCoreDecomposition (Tests)

Definition at line 54 of file vtkKCoreDecomposition.h.

Member Typedef Documentation

typedef vtkGraphAlgorithm vtkKCoreDecomposition::Superclass

Definition at line 59 of file vtkKCoreDecomposition.h.

Constructor & Destructor Documentation

vtkKCoreDecomposition::vtkKCoreDecomposition ( )
protected
vtkKCoreDecomposition::~vtkKCoreDecomposition ( )
protected

Member Function Documentation

static vtkKCoreDecomposition* vtkKCoreDecomposition::New ( )
static
static int vtkKCoreDecomposition::IsTypeOf ( const char *  type)
static
virtual int vtkKCoreDecomposition::IsA ( const char *  type)
virtual
static vtkKCoreDecomposition* vtkKCoreDecomposition::SafeDownCast ( vtkObjectBase *  o)
static
virtual vtkObjectBase* vtkKCoreDecomposition::NewInstanceInternal ( ) const
protectedvirtual
vtkKCoreDecomposition* vtkKCoreDecomposition::NewInstance ( ) const
void vtkKCoreDecomposition::PrintSelf ( ostream &  os,
vtkIndent  indent 
)
virtual void vtkKCoreDecomposition::SetOutputArrayName ( const char *  )
virtual

Set the output array name. If no output array name is set then the name 'KCoreDecompositionNumbers' is used.

virtual void vtkKCoreDecomposition::SetUseInDegreeNeighbors ( bool  )
virtual

Directed graphs only. Use only the in edges to compute the vertex degree of a vertex. The default is to use both in and out edges to compute vertex degree.

virtual bool vtkKCoreDecomposition::GetUseInDegreeNeighbors ( )
virtual

Directed graphs only. Use only the in edges to compute the vertex degree of a vertex. The default is to use both in and out edges to compute vertex degree.

virtual void vtkKCoreDecomposition::UseInDegreeNeighborsOn ( )
virtual

Directed graphs only. Use only the in edges to compute the vertex degree of a vertex. The default is to use both in and out edges to compute vertex degree.

virtual void vtkKCoreDecomposition::UseInDegreeNeighborsOff ( )
virtual

Directed graphs only. Use only the in edges to compute the vertex degree of a vertex. The default is to use both in and out edges to compute vertex degree.

virtual void vtkKCoreDecomposition::SetUseOutDegreeNeighbors ( bool  )
virtual

Directed graphs only. Use only the out edges to compute the vertex degree of a vertex. The default is to use both in and out edges to compute vertex degree.

virtual bool vtkKCoreDecomposition::GetUseOutDegreeNeighbors ( )
virtual

Directed graphs only. Use only the out edges to compute the vertex degree of a vertex. The default is to use both in and out edges to compute vertex degree.

virtual void vtkKCoreDecomposition::UseOutDegreeNeighborsOn ( )
virtual

Directed graphs only. Use only the out edges to compute the vertex degree of a vertex. The default is to use both in and out edges to compute vertex degree.

virtual void vtkKCoreDecomposition::UseOutDegreeNeighborsOff ( )
virtual

Directed graphs only. Use only the out edges to compute the vertex degree of a vertex. The default is to use both in and out edges to compute vertex degree.

virtual void vtkKCoreDecomposition::SetCheckInputGraph ( bool  )
virtual

Check the input graph for self loops and parallel edges. The k-core is not defined for graphs that contain either of these. Default is on.

virtual bool vtkKCoreDecomposition::GetCheckInputGraph ( )
virtual

Check the input graph for self loops and parallel edges. The k-core is not defined for graphs that contain either of these. Default is on.

virtual void vtkKCoreDecomposition::CheckInputGraphOn ( )
virtual

Check the input graph for self loops and parallel edges. The k-core is not defined for graphs that contain either of these. Default is on.

virtual void vtkKCoreDecomposition::CheckInputGraphOff ( )
virtual

Check the input graph for self loops and parallel edges. The k-core is not defined for graphs that contain either of these. Default is on.

int vtkKCoreDecomposition::RequestData ( vtkInformation *  ,
vtkInformationVector **  ,
vtkInformationVector *   
)
protected

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