Since bidirectional_tag derives from directed_tag, the documentation should probably say that directed_category must be convertible to directed_tag or undirected_tag. D. On Sunday 21 May 2006 20:08, Tiago de Paula Peixoto wrote:

Hi.

I've noted an apparent discrepancy between the documentation of the adjacency_list class and the actual behavior:

It's stated in the documentation that graph_traits::directed_category should be a typedef to "directed_tag" or "undirected_tag", depending on whether the graph is directed or not. Those are also the only possible types defined by the Graph concept. But when bidirectionalS is used as the Directed template parameter for adjacency_list, the type of the directed_category is set to "bidirectional_tag". Shouldn't this simply be set to "directed_tag", and the bidirectional information be confined to graph_traits::transversal_category? At least that's what the documentation says...

I didn't provide a test program, since this can easily be checked in the source code.

I'm using boost 1.33.1 and GCC 4.1.0.

Thanks.