edu.uci.ics.jung.algorithms.cluster
Class WeakComponentClusterer<V,E>

java.lang.Object
  edu.uci.ics.jung.algorithms.cluster.WeakComponentClusterer<V,E>

All Implemented Interfaces:

org.apache.commons.collections15.Transformer<Graph<V,E>,Set<Set<V>>>

public class WeakComponentClusterer<V,E>
extends Object
implements org.apache.commons.collections15.Transformer<Graph<V,E>,Set<Set<V>>>

Finds all weak components in a graph as sets of vertex sets. 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.

This implementation identifies components as sets of vertex sets. To create the induced graphs from any or all of these vertex sets, see algorithms.filters.FilterUtils.

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

Set<Set<V>>

transform(Graph<V,E> graph) 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

transform

public Set<Set<V>> transform(Graph<V,E> graph)

Extracts the weak components from a graph.

Specified by:

transform in interface org.apache.commons.collections15.Transformer<Graph<V,E>,Set<Set<V>>>

Parameters:

graph - the graph whose weak components are to be extracted

Returns:

the list of weak components