Overview | Package | Class | Use | Tree | Deprecated | Index | Help
PREV CLASS NEXT CLASS | FRAMES NO FRAMES
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD

## edu.uci.ics.jung.algorithms.cluster
Class WeakComponentClusterer

    java.lang.Object
      edu.uci.ics.jung.algorithms.cluster.WeakComponentClusterer

All Implemented Interfaces:
  GraphClusterer

public class WeakComponentClusterer
extends Object
implements GraphClusterer

Finds all weak components in a graph where a weak component is defined as a maximal subgraph in which all pairs of vertices in the subgraph are reachable from one another in the underlying undirected subgraph.

Running time: O(|V| + |E|) where |V| is the number of vertices and |E| is the number of edges.

Author:
  Scott White

Constructor Summary
`WeakComponentClusterer()`

Method Summary
`ClusterSet` | `extract(ArchetypeGraph aGraph)` Extracts the weak components from a graph.

Methods inherited from class java.lang.Object
`clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait`

Constructor Detail

### WeakComponentClusterer

    public WeakComponentClusterer()

Method Detail

### extract

    public ClusterSet extract(ArchetypeGraph aGraph)

  Extracts the weak components from a graph.

  Specified by:
    `extract` in interface `GraphClusterer`
  Parameters:
    `aGraph` - the graph whose weak components are to be extracted
  Returns:
    the list of weak components

Overview | Package | Class | Use | Tree | Deprecated | Index | Help
PREV CLASS NEXT CLASS | FRAMES NO FRAMES
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD