搜索资源列表
depthFirstDigraph
- 用java语言深度优先回溯法实现有向图的强连通分量
Dating-method
- 用回溯法解决最小长度电路板排列问题（JAVA实现）-Using backtracking to solve the minimum length of the circuit board arrangement of the problem (JAVA implementation)
CSP
- CSP算法java实现，并且有回溯法和mcSearch两种方法实现，结构好，容易懂-CSP algorithm java to achieve, and back and two ways to achieve mcSearch, structure, and easy to understand
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
KMP008
- 串的模式匹配的朴素算法是O(N^2)的, 可以 利用KMP(由D.E.Knuth, J.H.Morris, V.R.Pratt提出)算法改进至线性的算法. KMP算法与朴素算法的不同在于：处理"失配"情况. 不同于将指针完全回溯, KMP算法先根据已经部分匹配的信息, 将匹配的指针跳过不必匹配的位置.-Series of simple pattern matching algorithm is O (N ^ 2), and can make use of KMP (from DEKnuth,
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.
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!
MC
- Java实现，用回溯的方法解决n，k下的传教士野人问题。最后输出一个字符串数组，表示渡河过程-Java implementation, with the back of a solution n, k missionaries under the savage problems. The final output of a string array that cross the river course
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.
strategyback1509521711977
- 我在用jetty+cometd做comet服务，continuation机制已经加入，但是日志中出现了这样的异常(WARN:oejs.HttpChannel:qtp607635164-14195: Commit failed java.util.concurrent.TimeoutException: Idle timeout expired: 30000/30000 ms at org.eclipse.jetty.io.IdleTimeout.checkIdleTimeout(IdleTi
sudoku
- 数独游戏，利用回溯法，可进行数独求解，生成，简单无图形化源代码(Sudoku , originally called Number Place, is a logic-based, combinatorial number-placement puzzle.)
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).)
《趣学算法》Java源码
- 本书内容按照算法策略分为7章。第1章从算法之美、简单小问题、趣味故事引入算法概念、时间复杂度、空间复杂度的概念和计算方法，以及算法设计的爆炸性增量问题，使读者体验算法的奥妙。第2～7章介绍经典算法的设计策略、实战演练、算法分析及优化拓展，分别讲解贪心算法、分治算法、动态规划、回溯法、分支限界法、线性规划和网络流。每一种算法都有4～10个实例，共50个大型实例，包括经典的构造实例和实际应用实例，按照问题分析、算法设计、完美图解、伪代码详解、实战演练、算法解析及优化拓展的流程，讲解清楚且通俗易懂。附