[ns] Dijkstra's Implementation in NS-2

[Noor Asraf]

Hi all,
This seems to be a longstanding issue: I searched through this mail
archive to find out if there is an implementation that allows to
calculate shortest route (say in a route table or a tree), but unable
to find one.  I notice there is a bfs and dijkstra's code in
../routealgo/ but they appear to be standalone.

Anyone here tried to use this code or implmented something similiar?

Thanks,
Asraf