org.polarsys.capella.common.utils.graph

Class SCCSearch<T>

java.lang.Object

org.polarsys.capella.common.utils.graph.SCCSearch<T>

public class SCCSearch<T>
extends java.lang.Object

An implementation of Tarjan's algorithm to find the strongly connected components of a graph. This is similar (but not 100% the same) to finding cycles of a graph. http://en.wikipedia.org/wiki/Strongly_connected_components http://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm

Constructor Summary

Constructors

Constructor and Description
SCCSearch()

Method Summary

Modifier and Type	Method and Description
java.util.List<java.util.List<T>>	findSCC(IDirectedGraph<T> graph, boolean strict) Find the strongly connected components of a graph.

Methods inherited from class java.lang.Object

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

Constructor Detail

SCCSearch

public SCCSearch()

Method Detail

findSCC

public java.util.List<java.util.List<T>> findSCC(IDirectedGraph<T> graph,
                                                 boolean strict)

Find the strongly connected components of a graph.

Parameters:

contents - An iterator over the graph's nodes.

advisor - Provides informations about the graphs edges.

strict - whether elementary (size 1) sccs should be added to the result

Returns:

A list of strongly connected components of the graph. Never null.