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:

com.google.common.base.Function<Graph<V,E>,java.util.Set<java.util.Set<V>>>

public class WeakComponentClusterer<V,E>
extends java.lang.Object
implements com.google.common.base.Function<Graph<V,E>,java.util.Set<java.util.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.

Constructor Summary

Constructors

Constructor and Description
WeakComponentClusterer()

Method Summary

Modifier and Type	Method and Description
java.util.Set<java.util.Set<V>>	apply(Graph<V,E> graph) Extracts the weak components from a graph.

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface com.google.common.base.Function

equals

Constructor Detail

WeakComponentClusterer

public WeakComponentClusterer()

Method Detail

apply

public java.util.Set<java.util.Set<V>> apply(Graph<V,E> graph)

Extracts the weak components from a graph.

Specified by:

apply in interface com.google.common.base.Function<Graph<V,E>,java.util.Set<java.util.Set<V>>>

Parameters:

graph - the graph whose weak components are to be extracted

Returns:

the list of weak components