From: Jens MÃ¼ller (jens.mueller_at_[hidden])
Date: 2007-01-04 16:22:17
Are functions like Succ_Adj_Edge inofficial? I googled for them and
can't find any occurence in the official LEDA documentation.
The "official way" seem to be member functions of the GRAPH class ...
Obviously, in that case a reference to the graph would have to be stored
in the iterator as well, so I see the advantage of the current solution.
But shouldn't we stick to official interfaces?
I stumbled over this while looking how to add support for the
EdgeListGraph concept in the LEDA graph adapter ...
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk