From: Aaron Windsor (aaron.windsor_at_[hidden])
Date: 2008-04-09 08:37:00
On Wed, Apr 9, 2008 at 6:03 AM, Vicen <vgomez_at_[hidden]> wrote:
> I'm using the recent planar utilities of the boost graph library.
> The planarity test works quite well and now I'm wondering what would be
> the most elegant way for accessing to bundled edge properties within a
> As far as I can see, contrary to the other visitors (BFS, DFS, etc) only
> the vertex or the edge (not the graph) are arguments in the next_vertex
> or next_edge event points...
Your planar face traversal visitor could take a reference to a graph
in its constructor, store it as a member of the visitor, then use that
reference in next_vertex and/or next_edge. That's the way it's done in
the implementation of the function make_maximal_planar, for example. I
do agree that the way you suggest is more consistent with the other
BGL traversal visitors. I'd be willing to change this for the next
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk