Class WeakComponentClusterer<V,​E>

  • All Implemented Interfaces:
    org.apache.commons.collections4.Transformer<edu.uci.ics.jung.graph.Graph<V,​E>,​java.util.Set<java.util.Set<V>>>

    public class WeakComponentClusterer<V,​E>
    extends java.lang.Object
    implements org.apache.commons.collections4.Transformer<edu.uci.ics.jung.graph.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.

    • Method Summary

      All Methods Instance Methods Concrete Methods 
      Modifier and Type Method Description
      java.util.Set<java.util.Set<V>> transform​(edu.uci.ics.jung.graph.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 java.util.Set<java.util.Set<V>> transform​(edu.uci.ics.jung.graph.Graph<V,​E> graph)
        Extracts the weak components from a graph.
        Specified by:
        transform in interface org.apache.commons.collections4.Transformer<V,​E>
        Parameters:
        graph - the graph whose weak components are to be extracted
        Returns:
        the list of weak components