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>>>
,java.util.function.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 Description WeakComponentClusterer()
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description java.util.Set<java.util.Set<V>>
apply(Graph<V,E> graph)
Extracts the weak components from a graph.
-