sf.util.graph

Class TarjanStronglyConnectedComponentFinder<T extends java.lang.Comparable<? super T>>

java.lang.Object

sf.util.graph.TarjanStronglyConnectedComponentFinder<T>

Type Parameters:

T - Any comparable class

public class TarjanStronglyConnectedComponentFinder<T extends java.lang.Comparable<? super T>>
extends java.lang.Object

Implementation of Tarjan's algorithm

Author:

Sualeh Fatehi

Constructor Summary

Constructors

Constructor and Description
TarjanStronglyConnectedComponentFinder(DirectedGraph<T> graph)

Method Summary

Modifier and Type	Method and Description
java.util.Collection<java.util.List<T>>	detectCycles() Calculates the sets of strongly connected vertices.

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

TarjanStronglyConnectedComponentFinder

public TarjanStronglyConnectedComponentFinder(DirectedGraph<T> graph)

Method Detail

detectCycles

public java.util.Collection<java.util.List<T>> detectCycles()

Calculates the sets of strongly connected vertices.

Returns:

Set of strongly connected components (sets of vertices)