Installation-Setup.zip - Many interesting route planning problems can be solved by computing shortest paths
in a suitably modeled, weighted graph representing a transportation network. Such networks
are naturally road networks or timetable networks of public transportation. For
large networks, the classical Dijkstra algorithm to compute shortest paths is too slow.
And therefore have faster algorithms been developed in recent years. These new algorithms
have in common that they use precomputation and store auxiliary data to speedup
subsequent shortest-path queries.,2012-05-27 23:19:33,下载8次
intro-to-ns2.zip - Is a discrete event simulator for networking research
Simulates at packet level
Substantial support to simulate many protocols
Simulate wired and wirele,2012-05-27 23:18:45,下载5次
ns-tutorial.zip - The purpose of these pages is to make it easier for new ns users to use ns and nam, to create their own simulation
scenarios for these tools and to eventually add new functionality to ns. I,2012-05-27 23:09:35,下载2次
ns2.zip - Many interesting route planning problems can be solved by computing shortest paths
in a suitably modeled, weighted graph representing a transportation network. Such networks
are naturally road networks or timetable networks of public transportation. For
large networks, the classical Dijkstra algorithm to compute shortest paths is too slow.
And therefore have faster algorithms been developed in recent years. These new algorithms
have in common that they use precomputation and store auxiliary data to speedup
subsequent shortest-path queries.,2012-05-27 23:06:42,下载20次
ns.zip - Information Systems Laboratory
– Faculty for Computer Science
– Universitä t der Bundeswehr, Munich,2012-05-27 23:04:21,下载3次