D graph library -- update

[Joseph Rushton Wakeling]

On 07/11/2013 02:18 AM, bearophile wrote:
> If you want a meaningful memory comparison then perhaps you need a 10 or 100 (or
> more) times larger graph.

I know, and it's coming. :-)  The main memory-related issues will probably not
show up in a situation like this where all we're doing is storing the graph
data, but in the case where algorithms are being performed on the data.