Scalable Graph Coverage

If you're interested in dealing with large directed graphs of dependent objects and want some tips on how to process them in a way that scales in terms of memory usage, you may be interested in the article I wrote for Overload, which is a journal of the ACCU (an organisation promoting "professionalism in programming").

The article is Scalable Graph Coverage, or, in my original title, "Comparing scalable algorithms for walking all nodes of a dependency graph".

It contains lots of code, written in C++, using BOOST Graph Library. The code demonstrates some of the algorithms that are available for choosing batches of nodes to be processed together to reduce the number of nodes that are loaded several times, and without running out of memory.