[graph] leda_graph.hpp - Succ_Adj_Edge etc. undocumented in LEDA?
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 ...
On Jan 4, 2007, at 4:22 PM, Jens Müller wrote:
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?
Oops, yes we should stick to official interfaces. Thanks for looking into this! Cheers, Doug
Jens Müller wrote:
I stumbled over this while looking how to add support for the EdgeListGraph concept in the LEDA graph adapter ...
There is a comment in the source: // no edges(g) function Was this just due to a lack of time?
On Jan 12, 2007, at 12:21 PM, Jens Müller wrote:
Jens Müller wrote:
I stumbled over this while looking how to add support for the EdgeListGraph concept in the LEDA graph adapter ...
There is a comment in the source:
// no edges(g) function
Was this just due to a lack of time?
I wish I knew. Probably, yes. Cheers, Doug
participants (2)
-
Doug Gregor -
Jens Müller