Boost Users :
From: Alex Dow (alexdow_at_[hidden])
Date: 2008-07-01 05:07:51
Great, thanks a lot. This looks like what I need. I'll give it a shot.
On Sat, Jun 28, 2008 at 12:27 AM, Dmitry Bufistov <dmitry_at_[hidden]> wrote:
> Alex Dow wrote:
>> I'm looking for an online primer or tutorial on writing graph
>> adapters. I read "Converting Existing Graphs to BGL" from the BGL
>> documentation, as well as the docs for several of the existing graph
>> adapters (subgraph, edge_list), but I'm still not getting it. Any
>> leads would be helpful.
> Hi, Alex,
> Here I've tried to implement Daves idea.
> Works more or less for me. Please, try it out.
> The alternative approach would be to define
> "TetminatorFunction(Vertex u, const Graph& g)"
> in the way it returns true when the depth of the search
> is greater than some predefined constant. It can easily be done via global
> variables. However, I'm sure there is a better way to do it.
> Sr. Dmitry
> Boost-users mailing list
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