Algorithms: Design and Analysis, Part 1 - Programming Question 4

Problem:

Find the strongly connected components (strictly speaking, the sizes only) of a graph with 800k nodes.

Solution:

To make sure the code below run correctly, make sure we compile against x64 and make sure we have a large enough stack (e.g. 200MB)