I'm shocked that someone rewrote this and made the code worse... It was correct before it was updated 2 months ago. You're right that there's no need to sort.

Sorry, I didn't think about that. The line should indeed be removed, but this sentence should then also be modified (e.g. by removing the word 'sorted'):

When building the adjacency list of the condensation graph, we select the root of each component as the first vertex in its sorted list of vertices (this is an arbitrary choice).

Thanks for catching this mistake!

@el-sambal suggestion taken, updated the description!

Has this code really been tested? The code is called strongy rather than strongly...

Thanks for the pull request! Generally, the article was largely rewritten in#1307, and IMO it overall got much better than it was before. Unfortunately, I indeed missed that sorting adds unnecessary overhead in complexity, and that there is a typo in the function name. But other than that, the new code is tested to some extent intest_strongly_connected_components.cpp. Merging the change now.