搜索资源列表
suanfafenxi
- 五个经典的算法分析中的算法及例题，涉及到递归法、回溯法、动态规划法等经典算法-Analysis of the five classical algorithm and the example of the algorithm involves recursive law, retroactive law, such as the classic dynamic programming algorithm
maze
- 用c写的迷宫算法，只求出一条路径，用到了回溯法。-Written by c maze algorithm, seeking a way to track, using a retrospective method.
vc6.0shorttestpathsearch
- 货郎担最短路径生成 最短路径生成的算法不计其数 其中很多用回溯法 回溯法不错 不过很多新手写哦时候掌握不好效率 上传一个效率高的版本-Traveling Salesman generate the shortest path shortest path algorithm to generate many of which used numerous retrospective law retrospective laws, however good a lot of time to maste
recursiveBTKnapsack
- 用vc++6编写的程序，采用回溯法，解决背包问题。-Vc++6 with the preparation of the procedures, the use of backtracking to solve knapsack problem.
FenziJieding
- 分支限界法类似于回溯法，也是一种在问题的解空间树T上搜索问题解的算法-Branch and bound method is similar to retroactive law, is also a solution in the problem search space tree T on the issue of solution algorithm
TASKS
- 限界剪枝法语回溯法类似，是一种在问题的状态空间树中搜索解的算法。优先级用优先队列来实现，优先级高即估计函数值越低的结点越靠近队列开头位置。-French back-Bound pruning method similar to the problem is a state-space search tree algorithm solution. Priority queue with priority to the realization of the high priority that i
poj2488
- 回溯法的模板，关键是回溯的过程，以及在深搜过程中的方向问题-Backtracking template, the key is back process, as well as in the course of the deep question of the direction search
a
- 算法分析，此教程介绍一些常用的算法，比如回溯法，-failed to translate
5-3
- 回溯法解usaco 中 1-5-3母牛肋骨问题-Backtracking solution usaco cow ribs in the 1-5-3 problem
4-2
- dfs回溯法解usaco 1-4-2时钟问题-dfs backtracking solution usaco 1-4-2 clock problem
huisufa
- 使用回溯法解决01背包问题，适合于算法分析与设计的初学者-Use backtracking to solve 01 knapsack problem, algorithm analysis and design is suitable for beginners
horse
- 使用turbo C的图形图像库 编写的马踏棋盘的程序 使用回溯法实现-Using turbo C graphics image library board to prepare a horse riding programs to achieve the use of backtracking
eightqueens
- 这是一个有关八皇后的问题，可以输出所有的组合。采用回溯法生成共92种组合。-This is one of the eight queens problem, you can export all of the combinations. Using backtracking generates a total of 92 combinations.
suanfa
- 常用算法,为初学者服务,简单易懂,常用的算法设计方法： 数值算法：迭代法、递归法、插值法等； 非数值算法：分治法、贪婪法、回溯法等。-Commonly used algorithms, for beginners service, easy to understand, common algorithm design methods: numerical algorithms: iterative method, the recursive method, interpolation m
queen
- 用回溯法的思想解答 n皇后问题，掌握使用回溯法求解问题的基本思路-The idea with backtracking to answer n queens problem, master the use of backtracking to solve the problem of the basic ideas
wu
- 掌握使用回溯法求解问题的基本思路，用回朔法做n皇后问题-Use backtracking to solve the problem to master the basic ideas, with the retrospective method to do the n queens problem
nprime
- N Prime问题也可以成为N皇后问题，此算法这是回溯法,非递归实现.-N Prime problem can also be N Queens problem, this algorithm is backtracking, non-recursive implementation.
eightqueens
- 回溯法解决八皇后问题，使四个皇后不在同一行，不在同一列，且不在同一对角线上-Backtracking to solve the eight queens problem，Make four Queen s not in the same row, not in the same column, and not in the same diagonal
queen
- 用回溯法解决8皇后问题，用的是vc递归。一个92种解法，希望对大家有用。
NQueue
- 利用回溯法求解N皇后问题及其算法性能分析。-The use of backtracking algorithms for solving N Queens problem and its performance analysis.