StrongComponentClusterer (OpenDSE SNAPSHOT-20240315 Project API Documentation)

java.lang.Object
- net.sf.opendse.visualization.algorithm.StrongComponentClusterer<V,E>

Type Parameters:

V - the type of vertices

E - the type of edges

All Implemented Interfaces:

org.apache.commons.collections15.Transformer<edu.uci.ics.jung.graph.Graph<V,E>,Set<Set<V>>>
```
public class StrongComponentClusterer<V,E>
extends Object
implements org.apache.commons.collections15.Transformer<edu.uci.ics.jung.graph.Graph<V,E>,Set<Set<V>>>
```
The StrongComponentClusterer clusters a graph into strongly connected components using Tarjan's algorithms. See: Robert Tarjan: Depth-first search and linear graph algorithms. In: SIAM Journal on Computing. Vol. 1 (1972), No. 2, P. 146-160.

- Constructor Summary
  
  Constructors
  Constructor Description
  
  StrongComponentClusterer()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  Set<Set<V>> transform(edu.uci.ics.jung.graph.Graph<V,E> graph)
  - Methods inherited from class java.lang.Object
    equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

- Constructor Detail
  - StrongComponentClusterer
```
public StrongComponentClusterer()
```
- Method Detail
  - transform
```
public Set<Set<V>> transform(edu.uci.ics.jung.graph.Graph<V,E> graph)
```
    Specified by:
    
    transform in interface org.apache.commons.collections15.Transformer<V,E>