From: Andrew Sutton (asutton_at_[hidden])
Date: 2007-08-21 14:02:10
> Jens Müller wrote:
>> Sorry, forgot that (was quite busy the last month). So, I'll see if I
>> can turn my "make bidirected" adapter into an undirected adapter.
>> be quite the same, except that the both directions are equal, and
>> indices don't need to get adapted, and probably some other small
>> stuff ...
> Something like the attached one, if someone wanna take a look ...
> Nothing fancy, and probably with some bugs ...
I think you should rethink the name of your adapter. You're not
really implementing an undirected graph, you're simply removing the
edge directionality - which is a pretty cool feature. I think this is
more commonly referred to as an "underlying graph" of a directed
graph. It might be nice to have a function:
Besides, I have a vested interest in making sure there's nothing else
in the library named undirected_graph :)
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk