In this paper, the authors survey the public presentation between two adaptive routing algorithms: Link State Algorithm (LSA), which is centralized algorithm and Distance Vector Algorithm (DVA ...

Hi Guys, I am just playing with dijkstra algorithm in C# and got it working good but now I want to modify it to get all the possible paths from the start and target nodes. Any advise?

These protocols are like DSR (Dynamic Source Routing), AODV (Ad-hoc On-demand Distance Vector routing algorithm) and TORA (Temporally Ordered Routing Algorithm) like more.