We present a method for optimization of Tarjan’s algorithm for the detection of strongly connected components in a direct graph. The approach to its parallel implementation is offered, and the theoretical synthesis of the ...