|
Boost Users : |
From: Tiago de Paula Peixoto (tiago_at_[hidden])
Date: 2006-05-21 21:08:55
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<adjacency_list>::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<adjacency_list>::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.
-- Tiago de Paula Peixoto <tiago_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