Package org.nlpub.watset.graph

Class MaxMaxClustering.MaxMaxClusteringImpl<V>

java.lang.Object

org.jgrapht.alg.interfaces.ClusteringAlgorithm.ClusteringImpl<V>

org.nlpub.watset.graph.MaxMaxClustering.MaxMaxClusteringImpl<V>

Type Parameters:

V - the type of nodes in the graph

All Implemented Interfaces:

Serializable, Iterable<Set<V>>, org.jgrapht.alg.interfaces.ClusteringAlgorithm.Clustering<V>, MaxMaxClustering<V>

Enclosing interface:

MaxMaxClustering<V>

public static class MaxMaxClustering.MaxMaxClusteringImpl<V>
extends org.jgrapht.alg.interfaces.ClusteringAlgorithm.ClusteringImpl<V>
implements MaxMaxClustering<V>

Default implementation of the MaxMax clustering.

See Also:

Serialized Form

Nested Class Summary

Nested classes/interfaces inherited from interface org.nlpub.watset.graph.MaxMaxClustering

MaxMaxClustering.MaxMaxClusteringImpl<V>

Constructor Summary

Constructors

Constructor	Description
MaxMaxClusteringImpl(List<Set<V>> clusters, org.jgrapht.Graph<V,org.jgrapht.graph.DefaultEdge> digraph, Map<V,Set<V>> maximals, Map<V,Boolean> roots)	Construct a new MaxMax clustering.

Method Summary

Modifier and Type	Method	Description
org.jgrapht.Graph<V,org.jgrapht.graph.DefaultEdge>	getDigraph()	Return the directed graph representation of the input graph.
Map<V,Set<V>>	getMaximals()	Return the map of nodes to their maximal affinity nodes.
Map<V,Boolean>	getRoots()	Return the map of root and non-root nodes.

Methods inherited from class org.jgrapht.alg.interfaces.ClusteringAlgorithm.ClusteringImpl

getClusters, getNumberClusters, iterator, toString

Methods inherited from class java.lang.Object

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

Methods inherited from interface org.jgrapht.alg.interfaces.ClusteringAlgorithm.Clustering

getClusters, getNumberClusters

Methods inherited from interface java.lang.Iterable

forEach, iterator, spliterator

Constructor Detail

MaxMaxClusteringImpl

public MaxMaxClusteringImpl(List<Set<V>> clusters,
                            org.jgrapht.Graph<V,org.jgrapht.graph.DefaultEdge> digraph,
                            Map<V,Set<V>> maximals,
                            Map<V,Boolean> roots)

Construct a new MaxMax clustering.

Parameters:

clusters - the clusters

digraph - the directed graph representation

maximals - the map of maximal affinities

roots - the map of root and non-root nodes

Method Detail

getDigraph

public org.jgrapht.Graph<V,org.jgrapht.graph.DefaultEdge> getDigraph()

Description copied from interface: MaxMaxClustering

Return the directed graph representation of the input graph.

Specified by:

getDigraph in interface MaxMaxClustering<V>

Returns:

a directed graph

getMaximals

public Map<V,Set<V>> getMaximals()

Description copied from interface: MaxMaxClustering

Return the map of nodes to their maximal affinity nodes.

Specified by:

getMaximals in interface MaxMaxClustering<V>

Returns:

a map of maximal affinities

getRoots

public Map<V,Boolean> getRoots()

Description copied from interface: MaxMaxClustering

Return the map of root and non-root nodes.

Specified by:

getRoots in interface MaxMaxClustering<V>

Returns:

a map of root and non-root nodes