搜索资源列表
广度优先算法八数码问题
- 应用广度优先搜索策略:该算法首先根据输入的节点数(该程序可选的有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
有界深度优先算法八数码问题
- 该算法首先根据输入的节点数(该程序可选的有3X3,4X4…9X9几种节点数),然后输入初始状态和终点状态-the algorithm depending on the input nodes (which are optional procedures 3X3, 4X4 ... Frankfurt several nodes), then the initial state and the end of state
matrix
- java 为2D 3D画图 画4x4矩阵-Implementation of a 4x4 matrix suited for use in a 2D and 3D graphics rendering engine
2410_button_scan
- FS2410开发板16(4X4)键驱动程序-FS2410 development board 16 (4X4) key driver