infovis.graph.algorithm
Class KCoreDecomposition

java.lang.Object
  infovis.graph.algorithm.KCoreDecomposition

All Implemented Interfaces:

GraphChangedListener, EventListener

public class KCoreDecomposition
extends Object
implements GraphChangedListener

Computes the "coreness" of graph vertices. The "k-core" of a graph is the (unique) largest subgraph all of whose vertices have degree at least k.

Version:

$Revision: 1.5 $

Author:

Jean-Daniel Fekete

Field Summary

static String

CORENESS_COLUMN

Constructor Summary

KCoreDecomposition(Graph graph, IntColumn coreness)

Method Summary

static IntColumn	computeCoreness(Graph g, IntColumn coreness)
static IntColumn	computeEdgeCoreness(Graph g, IntColumn coreness, IntColumn edgeCoreness, IntIntFunction fn)
void	graphChanged(GraphChangedEvent e)
void	update()

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

CORENESS_COLUMN

public static final String CORENESS_COLUMN

See Also:

Constant Field Values

Constructor Detail

KCoreDecomposition

public KCoreDecomposition(Graph graph,
                          IntColumn coreness)

Method Detail

graphChanged

public void graphChanged(GraphChangedEvent e)

Specified by:

graphChanged in interface GraphChangedListener

update

public void update()

computeCoreness

public static IntColumn computeCoreness(Graph g,
                                        IntColumn coreness)

computeEdgeCoreness

public static IntColumn computeEdgeCoreness(Graph g,
                                            IntColumn coreness,
                                            IntColumn edgeCoreness,
                                            IntIntFunction fn)