Andre Poenitz wrote: > I think I have some code flying around that implement shortest path > searches. Interested?
Absolutely, but: If you think it's ok, I would try to make the separation first without changing the existing code. Once I have this working, we can think of changing the graph code (we can even consider putting boost.graph if we feel greedy). Send it anyway if you have it at hand. > > Andre' > Thanks, Alfredo
