Well, to some extent this can be parallelized. It looks like this:
Initially, all edges are sorted in ascending order. There is main threadone that actually scans each edge from the very beginning and decides whether the current edge adds a loop. Our main goal in parallelizing the algorithm is to make these checks parallel.
worker threads. , , ( , ). , , .
discarded. , , .
, , , .
, , .
EDIT:
, , @jarod42.