Boost logo

Boost Users :

From: Doug Gregor (dgregor_at_[hidden])
Date: 2006-06-27 09:09:45


On Jun 24, 2006, at 12:52 AM, Seweryn Habdank-Wojewódzki wrote:

> Hi everyone
>
> Is there a possibility to build a graph which nodes are
> automatically deleted
> when in the users code there is no reference to them?
>
> Maybe something that combines smart pointers and a graphs?

We don't have a graph type like that in the BGL, but it should be
quite easy to create one. If nothing else, vertex descriptors could
be smart pointers, and the values they point to store the in- and out-
edge lists.

        Doug


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