搜索资源列表
16
- 骑士巡游问题 -Knight-tour problem
dfssamples
- 朴素的没有优化过的dfs 题目有：借书问题，骑士的游历，迷宫问题，细胞个数-There is no simple optimized dfs topics: library issues, Knight' s tour, the maze problem, the cell number
king_visit
- 骑士巡游的非递归实现，代码树已经进行了优化，可以在最优时间内得带结果-Knight-tour of the non-recursive implementation, the code tree has been optimized, you can get the optimal time to bring the results of
Knight-to-travel-around
- 骑士周游问题，用回溯法计算~希望对大家有帮助~-Knights tour problem with backtracking method ~
KnightTravel
- 骑士周游问题，java，数据结构，显示骑士周游的每一种可能-Knights tour problem, java, data structure, showing every possible travel knight
Knights-tour-problem
- 用C语言实现著名的骑士巡游问题（用数据结构中的图实现）。-Famous knight tour problem with C language (using the data structure in Figure).
Knight
- 经典的骑士巡游问题，通过走日子来遍历棋盘，非回溯法，可以有效率的解决8*8棋盘的解决方案，但是不能保证所有问题都是有解的-Classic knight' s tour problem, by taking a day to traverse the board, non-backtracking, can be effective solution 8* 8 board solution, but can not guarantee that all problems are solvab
Ktour
- knight tour program
code
- 使用回溯法解决的典型问题的算法：骑士巡游问题，n皇后问题，0-1背包问题。 使用递归与分治策略解决的几个问题的算法：Hanoi塔问题和二分搜索技术。-Use backtracking to solve the typical problems of algorithms: knight tour problem, n queens problem 0-1 knapsack problem. Use recursion and divide and conquer strategy to so
DataStructure_KnightTraverse
- VC++6.0 编译环境 数据结构的游骑士遍历实现-VC++6.0 compile environmental data structure traversal implementation tour Knight
knight-tour_DFSandBFS_SQueue
- 在一个N*N的棋盘上指点任意一点的坐标，以马走日的方式走完整个棋盘且没有重复，试分别用DFS、BFS方法求解并输出全部可能的路径。-knight tour problem solved by the method of BFS and DFS.
KnightTour
- 数据结构中骑士游历问题的详细代码程序，开发环境为vc6-Data structure detailed code procedures, the development environment knight tour problem is vc6