On Wed, 2004-09-22 at 13:33, Jeffrey Holle wrote:
A word of advice. If you entend to mutate your graph, I sugguest using internal instead of external properties. Depending on the container types employed internally of the graph, which you can specify, the vertex/edge descriptors are not useable as keys. The vertex descriptor is simply an index when vecS is used. The edge descriptor is an object that lacks an operator< method.
I'd sugguest looking at adjacency_list_io.cpp for a non-trivial example of internal property usage. It as opposed to most other examples, actually has an custom struct.
Give the documentation description of what an adjacency_list is what I was planning on using. I would construct that graph and then traverse it with a visitor. I would not be changing graph in anyway during traversal. Thanks for the info. Stephen -- Email: storri@torri.org