Introduction - If you have any usage issues, please Google them yourself
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
Packet : 514389广度优先算法八数码问题.rar filelist
广度优先算法
广度优先算法\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