[boost] BGL: graph direction

[Vladimir Prus]

Jeremy,

When declaring adjacency_list, one can specify whether graph is directed or not, using selectors

directedS
undirectedS

and ....

bidirectionalS

No wonder I always try to type "bidirectedS" and get a compile error.
Is there any reason for different naming? No sure which is correct grammatically, but "bidirected" certainly used. For example, in LEDA
docs:

http://www.algorithmic-solutions.info/leda_manual/graph.html

(in the second section).

What do you think?

- Volodya

_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost