搜索资源列表
KnapsackProblem
- 0/1背包问题的几种解法,包括回溯法、动态规划法以及穷举法。另外还包括集中方法的一个测试报告。-0/1 knapsack problem several solutions, including backtracking, dynamic programming method and the exhaustive method. It also includes a focus on methods of test reports.
frame
- 用回溯法解决不是很麻烦的传教士和野人问题-By backtracking to solve is not very troublesome issue of missionaries and Savage
jingdiansuanf
- 二叉树的递归与非递归遍历(Java描述),高效实现Josephus算法,合并有序链表,基于队列实现的基数排序,栈.回溯.迷宫问题求解。5个算法的源程序。-Recursive and non recursive binary tree traversal (Java descr iption), efficient algorithms to achieve Josephus, merging sorted linked list, queue-based implementation of ra
candy
- example of candy problem, solved in java using backtracking algorithm and keeping saved solutions
EightQueen_java
- (This is Java version) The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so was originally proposed in 1848 by the chess player Max Bezzel, and over the years, many mathematicians, including Gauss, have wo
acmkdtree
- kdtree java 实现。。 实现了一个sql优化,减少了回溯次数,家少了执行时间-The kdtree java. . . . A sql optimization, reduce the number of backtracking, the home less execution time
classical-algorithms
- 许多经典算法问题的源代码,包括数据结构,分治,回溯,动态规划,图论,贪心等等,包括了C,C++和Java代码,已分成文件夹整理好.-Many classical algorithms of the source code, including data structures, divide and conquer, backtracking, dynamic programming, graph theory, greed, etc., including C, C++ and Java cod
Queens
- 八皇后,回溯法,JAVA实现,1维数组,可列出所有可行解-Eight Queens, backtracking, JAVA implementation, one-dimensional arrays, lists all feasible solutions
HorseTravel
- 用Java实现的回溯法 用预见算法解骑士游历问题。-Java implementation of backtracking
tic-tac-toe
- java 使用回溯算法写的三连棋 shi yong yuan lai de shuru he shuchu -java backtracking to program a project tic-ta-toe
MaxClique.java
- 回溯法求解最大团问题,时间复杂度为O(n*2^n)。(The backtracking method is used to solve the maximum clique problem with a time complexity of O (n*2^n).)