/* * Copyright (c) 2003, the JUNG Project and the Regents of the University * of California * All rights reserved. * * This software is open-source under the BSD license; see either * "license.txt" or * http://jung.sourceforge.net/license.txt for a description. */ package edu.uci.ics.jung.algorithms.cluster; import java.util.Collection; import java.util.HashSet; import java.util.Set; import org.apache.commons.collections15.Buffer; import org.apache.commons.collections15.Transformer; import org.apache.commons.collections15.buffer.UnboundedFifoBuffer; import edu.uci.ics.jung.graph.Graph; /** * 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
*/
public class WeakComponentClusterer