搜索资源列表
Three
- recall.c：回溯法求有向图是否存在回路，将结果输出到文件中。dfs.c：深度优先搜索解决N皇后问题，结果输出到文件。Client.java：一个java编写的即时通讯小程序。-recall. depth-first search. Instant message.
queen
- 回溯法解决八皇后问题,经典问题，算法分析与设计例子 -Backtracking to solve the Eight Queens，Classic problem, algorithm analysis and design examples
Cionchoice
- 这个软件是将整钱转化成零钱的软件，才用的是回溯法，整个程序最后的结果将会给出一个最优解及所需的钱数。零钱的类型可以由用户自己输入！-This software is the whole money into the change of software was used for backtracking, the final result of the entire program will give an optimal solution and the required amount of
hamilton
- 不同于回溯法，分治法解决马的hamilton问题，算法时间复杂度O(n)-the solution to hamilton problem
CatCatchMouse
- 回溯法求猫抓老鼠问题，要求输入m*n的地图，随机生成障碍物，求猫爪老鼠的路径-cat to find a way catch mouse by bfs
Maze
- 基于链栈结构，根据回溯法思想，制作了的一个显示5*5的迷宫的路径的算法-Based on the chain stack structure, based on Backtracking thought, made a display of 5*5 of the path of the maze algorithm
knapsack-problem
- 原创，背包问题的四种解法，回溯法，动态规划法，以及两种蛮力法，C++代码，编译运行通过，结果正确，可以比较各种方法的效率。-The original, four solutions of the knapsack problem, backtracking, dynamic programming, and two brute force method, C++ code, compile, run through, the result is correct, you can compare
huisufa0-1
- 算法分析-回溯法，0-1背包问题，按选优条件向前搜索，以达到目标。-Algorithm- Backtracking，0-1Knapsack problem，Forward search, the optimal selection conditions in order to achieve the goal.
knap-error
- 利用c++语言进行01背包问题回溯法解决实际问题-knapsack problem
Optimal-solution-back-to-France-0-1
- 最优解回溯法0-1问题，为了构造最优解，必须在算法中记录与当前最优值相应的当前最优解。-The optimal solution backtracking 0-1 must be recorded in the algorithm, in order to construct the optimal solution, corresponding to the current optimal value, the current optimal solution.
The-Questions-of-Queues
- N皇后问题,介绍N皇后问题的工作原理，以及如何利用回溯法的工作思想来解决问题。-The Question Of Queues
NQueueProgram
- 八皇后问题，一个经典的算法题，用的是回溯法，把所有的解全部解出来了-eight queue program , it s has the whole answer
Knight
- 经典的骑士巡游问题，通过走日子来遍历棋盘，非回溯法，可以有效率的解决8*8棋盘的解决方案，但是不能保证所有问题都是有解的-Classic knight' s tour problem, by taking a day to traverse the board, non-backtracking, can be effective solution 8* 8 board solution, but can not guarantee that all problems are solvab
N-huanghou
- 人工智能中的经典算法之一。对问题的多个分支选择一支进行探索，当探索到某一步时，发现原先选择并不优或达不到目标，就退回一步重新选择 回溯法适合用栈实现。探索过程当中入栈，退栈时返回分支选择的现场 -One of the classic algorithms in artificial intelligence. Multiple branches of the problem, choose one to explore, explore a step that the original
Subset-of-the-algorithm-and-back
- 子集和数的回溯法，用C++编写程序并运行得到结果。-Subset of the algorithm and back
frog
- 回溯法实现青蛙换位问题，算法作业可以参考来看-Backtracking to achieve the frog jump problem
0-1hs
- 0-1背包问题-回溯法,算法设计课程作业-0-1 knapsack problem- Backtracking algorithm design course work
Cpp1
- 算法分析，回溯法原理及基本实现，实现基本逻辑，完成主要功能-Algorithm analysis and backtracking principle and the basic realization of basic logic to complete the main function
huisufa
- 回溯法背包问题，很实用也是经过改进的背包问题-The backtracking knapsack problem, very practical and improved knapsack problem
N_queen
- 求N皇后问题的一个解，回溯法。在窗体文本框中输入N值，矩阵图显示皇后排布方式-Seek a solution of N-Queens problem, backtracking. In the form text box, enter the values of N, the matrix show the Queen arranged way