I'm not familiar with the details, but could there be a typedef or something like that in order to accept bidirectedS? Or maybe replacing the bidirectionalS with bidirectedS and making bidirectionalS typedef'd to bidirectedS?
Jeremy Siek wrote: > > 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, > ghost> > ghost> When declaring adjacency_list, one can specify whether graph is directed or > ghost> not, using selectors > ghost> > ghost> directedS > ghost> undirectedS > ghost> > ghost> and .... > ghost> > ghost> bidirectionalS _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
