Hi Volodya,
No reason in particular for the spelling. I'm sorry it is confusing, but
it is a bit late to change this now.
Cheers,
Jeremy
P.S. In LEDA "bidirected" means something different than what
"bidirectional" means in the BGL.
On Wed, 29 Jan 2003, Vladimir Prus wrote:
ghost>
ghost> Jeremy
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 cor
