COMPONENTS = TARJAN(G) searches for strongly connected components
using Tarjan's algorithm (it's actually depth first search).
G is an input directed graph. The function returns a vector COMPONENTS.
The value COMPONENTS(X) is number of component where the node X
belongs to.