Package org.nlpub.watset.graph

Interface MaxMaxClustering<V>

Type Parameters:

V - the type of nodes in the graph

All Superinterfaces:

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

All Known Implementing Classes:

MaxMaxClustering.MaxMaxClusteringImpl

public interface MaxMaxClustering<V>
extends org.jgrapht.alg.interfaces.ClusteringAlgorithm.Clustering<V>

A MaxMax clustering.

Nested Class Summary

Nested Classes

Modifier and Type	Interface	Description
static class	MaxMaxClustering.MaxMaxClusteringImpl<V>	Default implementation of the 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 interface org.jgrapht.alg.interfaces.ClusteringAlgorithm.Clustering

getClusters, getNumberClusters

Methods inherited from interface java.lang.Iterable

forEach, iterator, spliterator

Method Detail

getDigraph

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

Return the directed graph representation of the input graph.

Returns:

a directed graph

getMaximals

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

Return the map of nodes to their maximal affinity nodes.

Returns:

a map of maximal affinities

getRoots

Map<V,Boolean> getRoots()

Return the map of root and non-root nodes.

Returns:

a map of root and non-root nodes