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: 8数码问题的Java求解，采用A*算法。数据结构采用的Vector<int[]>。输出为"no solution"或一系列表示求解过程的字符串。
某些30步的测试样例需要半分钟左右，但是绝对是正确解~~万望您能不吝点滴时间耐心等待……orz thnx~~
我用的启发函数计算了现在的网格距离目标网格还有多远。
具体算法是，将每一格中的数字的坐标与其应该在的坐标的差加到一起，得到这个最终值h(x)
也就是Manhattan_Distance
源码使用方法：建立Java Project后，分别建立三个同名的.java文件，将源码分别复制过去然后编译运行即可。-a source code that solves the 8 puzzle problem. it uses A-star algorithm, and a major data structure of Vector<int[]>. The output of the program would be "no solution" or a series of strings representing the moves during the solution.
Well, some samples need to be proceeded for around 30 seconds, but the program per se is indeed correct and will ultimately generate the shortest solution. so if u encounter such occasion plz jst wait for a while tho~~~ thnx~!!
the heuristic function, say h(x), in this source code is the sum of the Mahattan Distance of each block from its destination block.
How to use: build a Java Project, and create three .java files with the same names in the .zip file accordingly, and copy the source from the .zip file and just compile and run~~!
have fun thnx~! Platform: |
Size: 669696 |
Author:Siegfried |
Hits:
Description: 这是一个模仿路由算法的java程序。
实现关于路由器的简单功能。
实现距离矢量路由算法。
所实现的路由器模拟Internet上的IP路由器。它能确定网络的最短路由，并在这些利用上传输分组
实现功能简介
1) 编写一个称为“Router”的程序
2) 利用距离向量算法更新路由表
3) 该程序的多个实例（进程或线程）可以以运行在一台机器
4) 实例之间利用UDP交换路由表
5) 假设结点与其邻居结点的都为距离为1。
6) 为了指明实例及其邻居，程序启动时必须能接收以下参数：
7) router ID, myport, port1, port2, port3…
8) 程序必须能处理以下命令：
a) N－打印活动的邻居列表。
b) T－输出路由表。
c) 0，1，… 9－发送分组
9) 关于时间定时
a) 每个路由器每2秒钟发出它们的路由表
b) 每个路由器根据收到的路由表更新它们自己的路由表
c) 路由器必须具备检测邻居是否活动的能力。如果路由器在6秒钟没有收到邻居发来的更新，则认为邻居不可达
10) 关于拓扑结构
a) 路由器必须具备路由器故障和恢复的能力
b) 这里假设链路不会出现故障，分组不会丢失和出错
c) 如果路由器在给定时间内未运行，表示路由器故障。如果重启运行，则认为路由器故障恢复
d)当然，假设通信是双向的
-This is a parody routing algorithm java program.
Achieve a simple function on the router.
Implement distance vector routing algorithm.
Internet router simulation achieved the IP router. It can determine the shortest route network, and in these transmission packet utilization
Achieve Features
A) preparation of a group called "Router" program
2) the use of distance vector algorithm updates the routing table
3) multiple instances of the program (processes or threads) can be run on a single machine
4) between instances using UDP exchange routing table
5) Assuming that node and its neighbor nodes are distance of 1.
6) In order to specify the instance and its neighbors, the program must be able to start receiving the following parameters:
7) router ID, myport, port1, port2, port3 ...
8) program must be able to deal with the following command:
a) N-printing activities neighbor list.
b) T-output routing table.
c) 0,1, ... 9- to send the packet
9) About Time Timing
a) given eve Platform: |
Size: 73728 |
Author:张天扬 |
Hits:
Search - distance vector in java