[Olsr-dev] Dijikstra

[L. Aaron Kaplan]

On Mar 29, 2010, at 7:10 PM, L. Aaron Kaplan wrote:

> 
> On Mar 29, 2010, at 7:01 PM, Airton Ishimori wrote:
> 
>> Hi list,
>> 
>> The olsrd-0.5.6-r8 utilize the Dijikstra algorithm for calculate better path? The Shortest Path Algorithm implemented into olsrd-0.5.6-r8 is the same that the Dijikstra or not? If not, which is the difference?
> 
> Mainly more efficient datastructures and faster algorithms (complexity wise).

Ok, I read your first mail as: "what is the difference to the previous Dijkstra implementation".
In both cases (before and after OLSR-NG optimizations) we used Dikjstra.

a.