|
Boost Users : |
From: Seweryn Habdank-Wojewódzki (habdank_at_[hidden])
Date: 2006-04-25 08:00:34
Hi!
Doug Gregor wrote:
> You can definitely use breadth_first_search/breadth_first_visit to
> compute the neighborhood out to some number of levels, just by
> keeping track of the distance from the source (initialized to zero)
> to each other vertex. For instance, the distance_recorder visitor
> marks the levels of each vertex:
>
> http://www.boost.org/libs/graph/doc/distance_recorder.html
Thanks a lot. so I am very happy that it is possible.
Best regards.
-- |\/\/| Seweryn Habdank-Wojewódzki `\/\/
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