Boost logo

Boost :

From: Roman Yakovenko (roman.yakovenko_at_[hidden])
Date: 2004-05-05 02:04:48

Pierre wrote:
> What I propose, in the case of bdb, is just an edge and a vertex
> container, which allows you to do something like :
> typedef adjacency_list<bdbS, bdbS, ...> Graph;
> and store you whole graph in a berkeley DB database, so that you can
> play with fairly big graphs...
> Hope it answers your question...
> > Pierre

Definitely. Thanks. Yes, I am interested. I have to deal with DAG, implemented on bdb.
I am in design phase of the project. So if you want to share your thought, it will be grate.


Boost list run by bdawes at, gregod at, cpdaniel at, john at