Date: 2004-05-03 08:41:23
as part of a project dealing with (very) big graphs, I am currently writing
The first one is aimed at situations when you have huge graphs and want to
distribute them among different computers. It uses MPI to communicate
The second is aimed at situations when you can't distribute your graph (e.g.
you're partitionning it before distributing it), or speed isn't an issue. It
uses a berkeley DB database to store the graph.
Is this code of interest for boost, would you consider reviewing it once
it's tested and stable ?
-- Written slowly for people who can't read fast.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk