搜索资源列表
骑士巡游
- 本程序是著名的骑士巡游问题,利用了最小度优先和回溯算法,-this procedure is the famous parade Cleveland, the use of the least priority and backtracking algorithms,
basicAlgorithm(pascal)
- 基本算法正稿 包括:一、数论算法；二、图论算法；三、背包问题；四、排序算法；五、高精度计算；六、 树的遍历；七 进制转换；八 全排列与组合的生成；九.查找算法；十、贪心；十一、回溯法框架；十二、DFS框架；十三、BFS框架；十五、数据结构相关算法
paike.rar
- 一个基于贪婪算法和分治算法以及回溯法的一个大型IT职业培训机构（湖北银河学院）的排课系统，采用AJAX+Mysql！！,A greedy algorithm based on the algorithm and sub-administration, as well as a large-scale retrospective law IT vocational training institutions (Institute of Hubei Galaxy) the Course Schedu
CSP
- CSP算法java实现，并且有回溯法和mcSearch两种方法实现，结构好，容易懂-CSP algorithm java to achieve, and back and two ways to achieve mcSearch, structure, and easy to understand
MC_java
- 人工智能，回溯方法解MC问题，java语言。主要算法在MC.java中，test.java是测试程序，运行test.java程序即可。-Artificial intelligence, backtracking method to solve the MC problem, java language. MC.java in the main algorithm, test.java is a test program, run test.java procedures.
TextureSynthesis
- 基于块拼接的纹理合成算法实现，在最小误差路径切割时做了修改，在重叠区域寻找回溯点再同时向下和向右寻找切割路径-Splicing block-based texture synthesis algorithm, the minimum error path of the cutting was revised, in the overlapping area at the same time looking for back points and then cut down and find th
Queen_Fasttest
- 8皇后问题，采用递归回溯算法，结构完美，迄今运算最快的-8queen program mit rekusiv method
Arithmetic
- 用JAVA完成的0-1背包算法，一共用了四种算法，包括贪心，分治，动态规划，回溯。把工程导入ECLIPSE下就可以了。-JAVA finished 0-1 with a knapsack algorithm, a share of the four algorithms, including greedy, divide and conquer, dynamic programming, backtracking. To work on it under into ECLIPSE.
src
- 对易阵游戏中两子交换的问题进行说明。讨论用回溯法搜索相邻两子交换的算法，进而研究任意两子交换的算法，重点研究搜索树的结构，并用类Java语言分别对其实现的最优算法进行描述。-On the trade front in the game two sons, the issue of exchange instructions. Discussions with the backtracking search algorithm two adjacent sub-exchange, and then
java
- 老师给的用Java编写的算法，包括背包问题， 回溯法等等，适合有基础的学习。-Teacher' s use of algorithms written in Java, including the knapsack problem, backtracking, etc., suitable for basic learning.
Traveling
- 利用回溯法实现了旅行售货员的算法,代码为java.-Achieved by backtracking the traveling salesman algorithms.
n_queen
- java和c++都有，算法为回溯。n后问题 注：i-j=k-l 或 i+j=k+l 说明2个皇后在对角线上-java and c++ there, the algorithm is a retrospective
n-queen
- 解决n皇后问题 利用回溯算法 n后问题等于在n×n格的棋盘上放置n个皇后，任何2个皇后不放在同一行或同一列或同一斜线上。即规定每一列放一个皇后，不会造成列上的冲突；当第i行被某个皇后占领后，则同一行上的所有空格都不能再放皇后，要把以i为下标的标记置为被占领状态。用回溯法解n后问题，用完全n叉树表示解空间。可行性约束Place剪去不满足行，列和斜线约束的子树。从根节点出发搜索解空间树。算法搜索至空间树的任何一结点时，先判断该点是否包含问题的解。如果肯定不包含，则跳过对以该结点为根的子树的搜索，
Knapsack
- 用java实现的01背包问题的有分支限界的回溯算法，注释非常详细，是我作业的一部分。伪代码可以参考《计算机算法与数据结构》这本书-Using java to achieve 01 knapsack problem branch-and-bound backtracking algorithm and very detailed notes, is part of my job. The pseudo-code can refer to this book of computer algorith
ChessTess
- 一个比较好的五子棋程序，可以用来参考。回溯算法。-A good backgammon program that can be used for reference. Backtracking algorithm.
Knapsack
- 使用Java编程，采用回溯算法来解决0-1背包问题。-Using the Java programming using backtracking algorithm to solve 0-1 knapsack problem.
beibao
- 文件里面的代码主要是用递归算法，动态规划的算法，贪婪算法，回溯算法解决没有利润分配的背包问题。-File inside the code is mainly used recursive algorithm, dynamic programming algorithms, greedy algorithms, backtracking algorithm to solve knapsack problem is no distribution of profits.
01backtrack
- JAVA实现的回溯算法，用来求解0-1背包问题，代码里面有注释，逻辑清晰-JAVA implementation of the backtracking algorithm used to solve the 0-1 knapsack problem, the code inside the notes, the logic clear
Queen
- 用java语言，基于回溯法实现N皇后的位置放置方案，程序可以通过参数来设置要解决几个皇后的放置，默认是4个。(Using java language, backtracking method is used to implement the placement plan of N queens. The program can be set by parameters to solve the placement of several queens, and the default is 4.)
回溯法（01背包问题）
- 回溯法解决01背包问题，111111111111111111(Backtracking method for solving 01 knapsack problems)