[Lemon-devel] Search algs and paths.

[Balazs Dezso]

Dear Developers,

the main point of our discussion was the path interface on Wednesday. We had 
decided in some questions. We redefined the path structure, the path is a 
sequence of consecutive edges, it does not need to enumerate the nodes, and 
the zero length path does not have specified starting node. One open question 
is the path building. Our conclusion was that we need some efficient 
building-dumping interface for paths.  One requirement for the path building 
is that we should be able to build a path represented by std::vector from 
dijkstra efficiently.

Best, Balazs