Package org.nlpub.watset.graph

Class MaxMax.Implementation<V,E>

java.lang.Object

org.nlpub.watset.graph.MaxMax.Implementation<V,E>

Type Parameters:

V - the type of nodes in the graph

E - the type of edges in the graph

Enclosing class:

MaxMax<V,E>

protected static class MaxMax.Implementation<V,E>
extends Object

Actual implementation of MaxMax.

Field Summary

Fields

Modifier and Type	Field	Description
protected org.jgrapht.Graph<V,org.jgrapht.graph.DefaultEdge>	digraph	The directed graph.
protected org.jgrapht.Graph<V,E>	graph	The graph.
protected Map<V,Set<V>>	maximals	The map of nodes to their maximal affinity nodes.
protected Map<V,Boolean>	roots	The map of root and non-root nodes.

Constructor Summary

Constructors

Constructor	Description
Implementation(org.jgrapht.Graph<V,E> graph)	Create an instance of the MaxMax clustering algorithm implementation.

Method Summary

Modifier and Type	Method	Description
MaxMaxClustering<V>	compute()	Perform clustering with MaxMax.
protected List<Set<V>>	extractClusters()	Extract clusters by traversing from the root nodes.

Methods inherited from class java.lang.Object

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

Field Detail

graph

protected final org.jgrapht.Graph<V,E> graph

The graph.

maximals

protected final Map<V,Set<V>> maximals

The map of nodes to their maximal affinity nodes.

digraph

protected final org.jgrapht.Graph<V,org.jgrapht.graph.DefaultEdge> digraph

The directed graph.

roots

protected final Map<V,Boolean> roots

The map of root and non-root nodes.

Constructor Detail

Implementation

public Implementation(org.jgrapht.Graph<V,E> graph)

Create an instance of the MaxMax clustering algorithm implementation.

Parameters:

graph - the graph

Method Detail

compute

public MaxMaxClustering<V> compute()

Perform clustering with MaxMax.

Returns:

the clustering

extractClusters

protected List<Set<V>> extractClusters()

Extract clusters by traversing from the root nodes.

Returns:

the clusters