Package pascal.taie.util.graph

Class SCC<N>

java.lang.Object

pascal.taie.util.graph.SCC<N>

Type Parameters:

N - type of nodes

public class SCC<N>
extends Object

Finds strongly connected components in a directed graph using Tarjan's algorithm.

Constructor Summary

Constructors

Constructor	Description
SCC(Graph<N> graph)

Method Summary

Modifier and Type	Method	Description
List<List<N>>	getComponents()
List<List<N>>	getTrueComponents()

Methods inherited from class java.lang.Object

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

Constructor Details

SCC

public SCC(Graph<N> graph)

Method Details

getComponents

public List<List<N>> getComponents()

Returns:

the list of the strongly-connected components

getTrueComponents

public List<List<N>> getTrueComponents()

Returns:

the list of the strongly-connected components, but only those that are true components, i.e. components which have more than one element or consists of one node that has itself as a successor