VTK

Compute the kcore decomposition of the input graph. More...
#include <vtkKCoreDecomposition.h>
Compute the kcore decomposition of the input graph.
The kcore decomposition is a graph partitioning strategy that is useful for analyzing the structure of large networks. A kcore of a graph G is a maximal connected subgraph of G in which all vertices have degree at least k. The kcore 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 kcores 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
Definition at line 53 of file vtkKCoreDecomposition.h.
Reimplemented from vtkGraphAlgorithm.
Definition at line 58 of file vtkKCoreDecomposition.h.
vtkKCoreDecomposition::vtkKCoreDecomposition  (  )  [protected] 
vtkKCoreDecomposition::~vtkKCoreDecomposition  (  )  [protected] 
static vtkKCoreDecomposition* vtkKCoreDecomposition::New  (  )  [static] 
Create an object with Debug turned off, modified time initialized to zero, and reference counting on.
Reimplemented from vtkGraphAlgorithm.
virtual const char* vtkKCoreDecomposition::GetClassName  (  )  [virtual] 
Reimplemented from vtkGraphAlgorithm.
static int vtkKCoreDecomposition::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 vtkKCoreDecomposition::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 vtkKCoreDecomposition* vtkKCoreDecomposition::SafeDownCast  (  vtkObject *  o  )  [static] 
Reimplemented from vtkGraphAlgorithm.
void vtkKCoreDecomposition::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.
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 kcore 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 kcore 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 kcore 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 kcore is not defined for graphs that contain either of these. Default is on.
int vtkKCoreDecomposition::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.