Description: 这个程序实现了距离矢量路由算法,又称Bellman-Ford算法,使用java编程实现.-This process achieved a distance vector routing algorithm, also known as Bellman-Ford algorithm, the use of java programming. Platform: |
Size: 16384 |
Author:cwh |
Hits:
Description: 使用Java语言编写模拟路由器程序，通过不同的IP端口（port），使用多线程模拟不同的路由器，路由器之间通过UDP协议交换路由信息，根据Bellman-ford算法确定下一条的路由节点。-The use of Java language router simulation procedures, through different IP port (port), the use of multi-threaded simulation of different routers, through the UDP protocol between routers exchange routing information, according to Bellman-ford algorithm to determine the next a routing node. Platform: |
Size: 43008 |
Author:邓瑞龙 |
Hits:
Description: 个程序实现了距离矢量路由算法,又称Bellman-Ford算法,使用java编程实现.-This process achieved a distance vector routing algorithm, also known as Bellman-Ford algorithm Platform: |
Size: 18432 |
Author:xiao |
Hits:
Description: 个程序实现了距离矢量路由算法,又称Bellman-Ford算法,使用java编程实现.-This process achieved a distance vector routing algorithm, also known as Bellman-Ford algorithm Platform: |
Size: 68608 |
Author:xiao |
Hits:
Description: 用Java语言写的移动通信网络（ad hoc）中很多经典的路由协议所用到的Bellman-Ford算法，使用到多线程和UDP协议来进行数据传输-Written using Java language for mobile communications network (ad hoc), many of the classical routing protocols used by the Bellman-Ford algorithm, using the multi-threaded and UDP protocols for data transfer Platform: |
Size: 3072 |
Author:唐叶 |
Hits:
Description: Java application to calculate minimum paths with the help of Bellman-Ford algorithm. Source code is implimented with Intellij ide. Platform: |
Size: 74752 |
Author:ilya |
Hits:
Description: 是由 Richard Bellman 和 Lester Ford 創立的，求解單源最短路徑問題的一種演算法. 常見的最短路徑問題演算法還有 Dijkstra s algorithm, 且 Dijkstra 演算法不允許路徑的 cost 是負值, 但此演算法不受此限制. 但是如果圖形中有包含 cycle, 且 cycle 上面的 cost 的合為負值, 則此演算法不適合用於此種圖形-By Richard Bellman and Lester Ford founded, single-source shortest path problem solving an algorithm. Common shortest path algorithm as well as Dijkstra s algorithm, and the algorithm does not allow cost Dijkstra path is negative, but this algorithm this restriction is not fit. but if there are graphics contained cycle, and the cycle above cost is negative, this algorithm is not suitable for such graphics. Platform: |
Size: 1024 |
Author:陳成瑞 |
Hits:
Search - bellman ford java