搜索资源列表
骑士巡游
- 本程序是著名的骑士巡游问题,利用了最小度优先和回溯算法,-this procedure is the famous parade Cleveland, the use of the least priority and backtracking algorithms,
Dating-method
- 用回溯法解决最小长度电路板排列问题（JAVA实现）-Using backtracking to solve the minimum length of the circuit board arrangement of the problem (JAVA implementation)
TourOfKnight
- 马周游——8*8棋盘，采用回溯法动态实现。-Ma tour- 8* 8 chessboard, using the dynamic realization of backtracking.
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
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.
Queen
- 这是一个关于八皇后问题用回溯法求解的java解法！-This is the one on the eight queens problem using backtracking method for solving the java solution!
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
Backtracking
- three problem of backtracking
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.
sudoku
- a very simple example of backtracking solution to generate a sudoku grid, and its answer. only need to have a dificult analizer. just try to clear a certain cuantity of numbers. sorry by my english. i hope this will be usefull
004
- 用蛮力法和回溯法求解子集和数问题，大家可以参考借鉴一下-Use brute force method and backtracking to solve a subset of several issues, we can look for references
queen
- java 皇后问题 回溯法实现 带图形界面实现-java queens backtracking with a graphical interface implementation to achieve
0_1Knasack
- 比较了求解0-1背包问题常用的几种算法，并用回溯法和分支限界法进行了Java编程实现，给出了文档及源码。-0-1 knapsack problem compared several commonly used algorithms, and use backtracking and branch and bound method of the Java programming, given the documentation and source code.
bt.java.tar
- Backtracking example
LVQueen
- 拉斯维加斯算法+回溯法，直到找出第一个可行解为止-Las Vegas algorithms+ backtracking until you find the first feasible solution so far
bigTuan
- 算法分析与设计 最大团问题 G的最大团是指G中所含顶点数最多的团。 无向图的最大团和最大独立集问题都可以看作是图G的顶点集V的 子集选取问题可以用回溯法在O(n*(2^n))时间内解决。-Algorithm analysis and design problem G, the biggest group the biggest group is the maximum number of vertices of G contained in the group. Undirect