[Lemon-devel] Search algs and paths.

[Alpár Jüttner]

Dear all,

as a next step, we should clean up the interfaces of the path related
algorithms (BFS, DFS, Dijkstra etc.). For this however, we also have to
clarify the Path concept. 

The current design is the best we have found so far, but I'm still quite
unsatisfied with it.

The major difficulty is that the algorithms above can typically list the
edges of a path backwards and cannot determine the length (the number of
the edges) of a path in advance. Of course we would like to minimize the
copying/counting overhead when working with path. The concept should
also enable implementing path structures with small memory footprint.

I kindly ask everyone to comment the current concept and also try to
come up with alternative approaches.

Regards,
Alpar

-- 
In order to prevent people from receiving viruses
that would seem to originate from my email,
if you use Microsoft Windows you do not have permission
to add this address to your address book.
If I am in your address book, please remove me.
Of course, this does not apply to GNU/Linux users. 
Thank you.