public class WeakComponentClusterer<V,E> extends Object implements com.google.common.base.Function<Graph<V,E>,Set<Set<V>>>
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 and Description |
---|
WeakComponentClusterer() |
Modifier and Type | Method and Description |
---|---|
Set<Set<V>> |
apply(Graph<V,E> graph)
Extracts the weak components from a graph.
|
Copyright © 2015. All rights reserved.