搜索资源列表
suanfa
- 算法结构代码，第五章5-15答案，用回溯法解决并行工作分配问题-Algorithm structure code, chapter V 5-15 answers, working in parallel with the backtracking method to deal with the allocation of
huisufa0-1beibaowenti
- 算法分析与设计中的经典问题，利用回溯法解决背包问题，有详细的代码段。-Algorithm analysis and design of the classic problems, the use of backtracking to solve knapsack problem, there is a detailed code snippet.
beibao
- 算法实验C++编程用回溯法解决01背包问题-Experimental C++ programming algorithm with backtracking to solve 01 backpack
jumphorse
- 解决棋盘的马从第一个位置开始跳经过每个位置，用回溯法解决-To solve the board' s horse began to jump from the first position through each location, using backtracking to solve
a
- 为了方便大家更好的学习算法分析，我上传了一个用回溯法解决的01背包问题-In order to facilitate a better learning algorithm all analysis, I uploaded a backtracking method to deal with the 01 knapsack problem
frame
- 用回溯法解决不是很麻烦的传教士和野人问题-By backtracking to solve is not very troublesome issue of missionaries and Savage
2222
- 旅行商问题 实现方法为回溯法 经acm测试通过-无
w
- 子集树回溯法 试设计一个用回溯法搜索子集空间树的函数。该函数的参数包括结点可行性判定函数和上界函数等必要的函数，并将此函数用于解装载问题。 装载问题描述如下：有一批共n个集装箱要装上艘载重量为c的轮船，其中集装箱i的重量为wi。找出一种最优装载方案，将轮船尽可能装满，即在装载体积不受限制的情况下，将尽可能重的集装箱装上轮船。-A subset of the trial design of a backtracking tree with backtracking search a subs
1
- 解数独，采用了回溯法，效率不是很高，但是算法很简洁-Means it alone, using a retrospective method, efficiency is not high, but the algorithm is very simple. . .
01knapsackproblem
- 回溯法解决01背包问题，是在标准C++上运行的代码，故在VC++上也能运行良好！-Backtracking to solve 01 knapsack problem is in the standard C++ code to run on, so the VC++ is also able to run well!
n_queens
- 图形化N后问题回溯解法,用回溯法求N后问题的所有解并以列表方式给出,某个向量解给出其图形化解布局-After the story goes back a graphical solution of N, N using backtracking after seeking all solutions of the problem and in tabular form are given, a vector graphics to resolve the layout of its soluti
Sudoku
- 回溯法生成数独-Backtracking generates Sudoku
HORSE
- 回溯法的马周游问题 回溯法的马周游问题-Backtracking problem horse travel horse travel problems backtracking backtracking horse travel problems
mataqipan
- 利用回溯法+贪心算法实现马踏棋盘功能。具体描述：有一M*N的棋盘，输入马所在的起始位置，输出马走过的全部路径。（马走过棋盘上每一个点）-The use of backtracking greedy algorithm+ horse riding board features. Specific descr iption: There is an M* N chessboard, enter the horse where the starting position, the output of
back
- 本程序给出回溯法的具体实现过程，可以帮助读者较好的了解回溯的思想-This program gives concrete realization of the process of backtracking, you can help readers better understand the idea back
BackTrack_01backpack
- 0-1背包问题是一个经典的算法问题，有多种解法，这里用回溯法求解。-0-1 knapsack problem is a classical algorithm for the problem, there are several solution here solved by backtracking.
NQueens
- 经典的N皇后问题的实现，使用的算法是回溯法-Classic implementation of N-Queens problem, using the algorithm is backtracking
Computeralgorithmsr
- 计算机算法_贪婪算法 计算机算法（贪心算法，遍历搜索，递归，回溯法，分治法，分枝定界) 关于这方面的介绍-计算机算法_贪婪算
0-1hui
- 0-1背包问题 关于回溯法的背包问题 回溯法在求问题的所有解时, 要回溯到根结点, 且根结点的所有子树都已被搜索过才结束。-0-1 背包问题
maze
- 用回溯法实现一个可以是若干大的迷宫的自动寻线走同-maze