> @Muugii0909 > "Dijkstra shortest path"
By default NS2 uses Dijkstra´s shortest path algorithm to compute optimal routes for all pairs of nodes. See https://books.google.dk/books?id=_VkTzFLnwD4C&pg=PA113&lpg=PA113&dq=ns2+Dijkstra+shortest+path&source=bl&ots=___4oh8xug&sig=0QrrQrCKWnwhyMaNoYb7KqLFTd4&hl=en&sa=X&ei=TuT6VJydAomiygOVrIHQDg&ved=0CDsQ6AEwBA#v=onepage&q=ns2%20Dijkstra%20shortest%20path&f=false dijkstra.cc : ns-2.xx/routealgo/dijkstra.cc Google https://www.google.com/webhp?hl=all&gws_rd=ssl#hl=en&q=ns2+Dijkstra+shortest+path . http://www.academia.edu/5662602/Report_on_Djikstra_and_Network_simulator . http://www.codeproject.com/Articles/19919/Shortest-Path-Problem-Dijkstra-s-Algorithm . http://www.sourcecodeonline.com/list?q=ns2_code_for_shortest_path_routing Shortest Path Routing for Sensor Networks : http://www.cs.binghamton.edu/~kliu/research/ns2code/#spr - -- View this message in context: http://network-simulator-ns-2.7690.n7.nabble.com/about-Dijkstra-shortest-path-DAP-Protocol-tp29780p29781.html Sent from the ns-users mailing list archive at Nabble.com.
