搜索资源列表
Dating-method
- 用回溯法解决最小长度电路板排列问题（JAVA实现）-Using backtracking to solve the minimum length of the circuit board arrangement of the problem (JAVA implementation)
queen
- 这是在Jcreator下用java语言编写的八皇后问题，采用递归回溯解决，在控制台打印输出92个解-This is at Jcreator using java language eight Queen' s problem using recursive backtracking resolved, at the console printout 92 Solutions
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.
resueltas
- Java examples for dinamic programming, divide and conquer, greedy algorithms and backtracking.
Maze
- all possible solution to Maze using backtracking algorithm in Java
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.
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
Queen
- 这是一个关于八皇后问题用回溯法求解的java解法！-This is the one on the eight queens problem using backtracking method for solving the java solution!
candy
- example of candy problem, solved in java using backtracking algorithm and keeping saved solutions
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.
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.
bt.java.tar
- Backtracking example
Subset
- 算法分析与设计 用回溯法解决子集合问题（java源码）-Algorithm Analysis and Design Subset Issues with Backtracking. (Java source code)
java-Maze
- This a java base maze travailing algorithm, backtracking based. Recursively travels trough the maze and find the target in the maze. -This is a java base maze travailing algorithm, backtracking based. Recursively travels trough the maze and find the
Queens
- 八皇后,回溯法,JAVA实现,1维数组,可列出所有可行解-Eight Queens, backtracking, JAVA implementation, one-dimensional arrays, lists all feasible solutions
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)
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).)