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>,Set<Set<V>>>, Function<Graph<V,E>,Set<Set<V>>>

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

  • Constructor Details

    • WeakComponentClusterer

      public WeakComponentClusterer()
  • Method Details

    • apply

      public Set<Set<V>> apply(Graph<V,E> graph)
      Extracts the weak components from a graph.
      Specified by:
      apply in interface com.google.common.base.Function<V,E>
      Specified by:
      apply in interface Function<V,E>
      Parameters:
      graph - the graph whose weak components are to be extracted
      Returns:
      the list of weak components