Hi Doug, Could you please clarify this one to me ? You say "we really can't do (too much code !)" because of lack of time/resources to do it or because you think it is not the right thing to do ? Because in my opinion if it turns the library interface more convenient to use it seems like a good idea to do it. Thank you for your attention, Mauricio Gomes Pensar Digital phone: 55-11-4121-6287 mobile: 55-11-8319-9610 http://pensardigital.com On Mar 9, 2005, at 8:06 PM, Douglas Gregor wrote:
My last problem is with the depth_first_search() algorithm... and of course bundled properties. This algorithm takes a const Graph &; but I want to be able to modify (while running the algorithm) the bundled properties!! That is the whole point of running this algorithm. I don't want to change the structure of the graph (the abstract graph - links from vertices to edges, etc), while running the algorithm, of course, but I do want to change when I want my bundled properties... that is not possible (at least, not without compiler warnings, which I don't like :-) due to the fact that depth_first_search expects a const graph.
Yeah, this is an annoying problem. We'd like to be able to take either a const or a non-const graph, but doing so would require two overloads of the algorithm, which we really can't do (too much code!).