|
Boost Users : |
Subject: Re: [Boost-users] [BGL] iterator/descriptor invalidation
From: Andrew Sutton (andrew.n.sutton_at_[hidden])
Date: 2008-12-10 11:10:07
> Why instead of updating the documentation you'd better try to implemented
> directedS edge_iterator version in the way similar to the undirectedS and
> bidirectionalS versions?
>
For two reasons. First, it's not a bug, just an artifact of data type
selection. Second, because solving this problem would require a large and
intrusive rewrite of how adjacency lists are implemented and probably
result in less efficient (time+space) graphs.
The nice thing about the library being generic, is that you can create a new
directed graph implementation that doesn't suffer these artifacts, and adapt
it to the BGL interface.
Andrew Sutton
andrew.n.sutton_at_[hidden]
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