应用广度优先搜索策略:该算法首先根据输入的节点数(该程序可选的有3X3,4X4…9X9几种节点数),然后输入初始状态和终点状态...
- 资源大小:56.01 kB
- 上传时间:2021-06-30
- 下载次数:0次
- 浏览次数:1次
- 资源积分:1积分
-
标 签:
Java
Develop
java
资 源 简 介
应用广度优先搜索策略:该算法首先根据输入的节点数(该程序可选的有3X3,4X4…9X9几种节点数),然后输入初始状态和终点状态-application breadth- first search strategies : The first algorithm based on the input nodes (which are optional procedures 3X3, 4X4 ... Frankfurt several nodes), then the initial state and the end of state
文 件 列 表
广度优先算法
Block.class
testBlock.class
BlockFace$ChooseBlockNUM.class
BlockFace$checkFirst.class
BlockFace$checkObject.class
BlockFace$1.class
BlockFace.class
test.class
MoveBlock.java
MoveBlock$ButtonListener.class
MoveBlock$1.class
MoveBlock.class
Block.java
BlockFace.java
方块移动.doc