MaxMax.Implementation (Watset 2.8.1 API)

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,Double>`	`weights`	The weights.

Constructor Summary

Constructors
Constructor Description

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

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method	Description
`protected void`	`buildArcs()`	Build the intermediate directed graph.
`MaxMaxClustering<V>`	`compute()`	Perform clustering with MaxMax.
`protected Map<V,Set<V>>`	`extractClusters()`	Extract the quasi-strongly connected subgraphs from the intermediate directed graph.

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.
  - weights
```
protected final Map<V,Double> weights
```
    The weights.
  - digraph
```
protected final org.jgrapht.Graph<V,org.jgrapht.graph.DefaultEdge> digraph
```
    The directed graph.
- 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
  - buildArcs
```
protected void buildArcs()
```
    Build the intermediate directed graph.
  - extractClusters
```
protected Map<V,Set<V>> extractClusters()
```
    Extract the quasi-strongly connected subgraphs from the intermediate directed graph.
    
    Returns:
    
    the map of cluster roots to the clusters