Example

Uses

Cyclic dependencies

In various cases, dependencies might be cyclic and a group of interdependant
actions must be executed simultaneously. It is not uncommon that
the simulataneous execution is costly. With Tarjan's algorithm, one can
determine an efficient order in which to execute the groups of interdependant
actions.

Transitive closure

Using Tarjan's algorithm, one can efficiently compute the transitive
closure of a graph. (Given a graph G, the transitive closure of G
is a graph that contains the same vertices and contains an edge from v
to w if and only if there is a path from v to w in G.)

Expand group hierarchies

Given a graph of groups, one can use the transitive closure to determine
all indirect members of a group. (Someone is an indirect member of a group,
if it is a member of a group that is a member of a group that ... is a member
of the group.)