On Dec 6, 2007 8:40 PM, David A. Greene
On Thursday 06 December 2007 10:39, Johan Oudinet wrote:
What Aaron try to explain you is that the vertex (edge) properties are bound to their corresponding vertex (edge). So the complexity to look for a vertex property is the same than finding its corresponding vertex.
If you want to have constant time access to vertex properties, clearly don't use a ListS for your VertexList but a VecS for example.
Ok, that's what I would have expected (vecS constant-time, listS not). Thanks for confirming that.
You're welcome. Furthermore, space and time complexity for each container are explained in the documentation : http://www.boost.org/libs/graph/doc/using_adjacency_list.html#sec:choosing-g... Regards, -- Johan