|
Boost Users : |
Subject: Re: [Boost-users] [BGL] reducing memory requirements for adjacency list
From: Soeren Meyer-Eppler (Soeren.Meyer-Eppler_at_[hidden])
Date: 2009-09-02 03:31:28
> bidirectional graph interfaces. If you would not like to do that
> yourself, please file a Trac ticket requesting the feature.
I have filed a new ticket #3386. I do believe this feature to be of
general interest, so I think a library implementation is preferable
to me hacking my own.
You'd be the one implementing it? Any idea when it might become
available?
> The latter; there is a vector of vertex properties and a vector of edge
> properties, each indexed by the numbers of the corresponding objects.
sweet.
best regards,
Sören
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net