Find the giant strongly connected component of the graph using the Tarjan algorithm.

An implementation by GraphStream.

For more details see:

• GraphStream Documentation
• Wikipedia