org.clafer.graph

Class GraphUtil

java.lang.Object

org.clafer.graph.GraphUtil

public class GraphUtil
extends Object

Author:

jimmy

Method Summary

Methods

Modifier and Type	Method and Description
static <V> List<Set<V>>	computeStronglyConnectedComponents(Graph<V> graph) Compute the strongly connected components in the graph in topological order.
static <V> boolean	hasPath(Vertex<V> start, Vertex<V> end, Graph<V> graph)

Methods inherited from class java.lang.Object

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

Method Detail

hasPath

public static <V> boolean hasPath(Vertex<V> start,
                  Vertex<V> end,
                  Graph<V> graph)

computeStronglyConnectedComponents

public static <V> List<Set<V>> computeStronglyConnectedComponents(Graph<V> graph)

Compute the strongly connected components in the graph in topological order. Implementation of Tarjan's algorithm.

Type Parameters:

V -

Parameters:

graph -

Returns:

the strongly connected components in topological order.

See Also:

Tarjan's algorithm