[Haskell-cafe] Large graphs

tomberek tomberek at gmail.com
Tue May 22 05:59:23 CEST 2012

> I can try to use the nodes/specs you provide to give you an estimate
> of what my framework can handle. If that works for you, I'll clean up
> my code and you can give it a shot. Send me whatever other details you
> think are relevant.


I had a few moments, so I made a sparse graph of 100k nodes, each with
2-3 edges with each node holding an unboxed int. This is created in
0.12 sec and then traversed for 100 million steps (add one to each
node, then move to next node) in an additional 9 secs but no more GC's
or allocations.

Let me know if this would help you out, I would like a chance to use
my pet project for something useful.

More information about the Haskell-Cafe mailing list