Matthew Toseland wrote: > The main outstanding issue is how frequently we should do path folding. > If it is too slow, it will take too long to converge. But if it is too > fast, then oskar's routing algorithm won't be able to keep up. Is there > any way to determine an optimal time short of alchemy?
Is there some wiki/doc with further explanation of oskar's algorithm and path folding details? I would like to understand it properly.
