搜索资源列表
QueenN
- 随机算法与回溯算法结合解N皇后问题.小程序,主要体现算法设计思想.-Randomized algorithm with backtracking algorithms N Queen s problem solution. Applet, the main embodiment of algorithm design.
depthFirstDigraph
- 用java语言深度优先回溯法实现有向图的强连通分量-Using java language backtracking depth-first to achieve directed graph strongly connected component
strkmp
- 微软面试题：给出一个函数来输出一个字符串的所有排列。 简单的回溯就可以实现了。当然排列的产生也有很多种算法，去看看组合数学，还有逆序生成排列和一些不需要递归生成排列的方法。印象中Knuth的<TAOCP>第一卷里面深入讲了排列的生成。这些算法的理解需要一定的数学功底，也需要一定的灵感，有兴趣最好看看。-Microsoft Surface questions: given a function to output a st
n_queen
- 回溯算法解决n皇后问题，c++源码，可以参考-Backtracking algorithm to solve the problem n Queen, c++ Source code, can refer to
algorithmDesignPPT
- 算法设计与文件的整套电子教案，主要包括递归和分治方法、动态规划算法、贪心算法、回溯法、分支限界法等常用算法和NP问题-Algorithm design and documentation package of electronic lesson plans, including recursive and sub-rule method, dynamic programming algorithm, greedy algorithms,
ChinaMapColor
- 一般回溯算法，遗传算法等对中国地图各省按四色原理着色-General backtracking algorithm, genetic algorithm, such as the map of China provinces by the principle of four-color shading
suanfabaogao
- 算法设计与分析试验报告，含全部实验源代码，包括贪心法、回溯法、深度优先搜索、分治法等，内容详尽。-Algorithm design and analysis of the test report, containing all the experimental source code, including the greedy method, backtracking, depth-first search, sub-rule law,
huisu
- 用回溯法实现马周游，学习算法设计时做的实验-With backtracking realize horse travel, learning algorithm designed to do the experiment
Algorithm_Design
- 算法设计与分析，其中包括贪婪算法、分而治之算法、动态规划、回溯、分枝定界-Algorithm design and analysis, including greedy algorithms, divide and conquer algorithms, dynamic programming, backtracking, branch and bound
bload
- 简单的回溯算法，算法分析与设计，比较简单适合初学-Simple backtracking algorithms, algorithm analysis and design, is relatively simple for beginners
packet
- 输入物品的个数和背包的负重大小；程序自动为每个物品的重量和价值赋一个随机值(范围10~80)，输出装入背包的物品的总价值最大的值和此时的总物品大小。实现方法：1 回溯法，2 FIFO分枝限界，3 LC分枝限界； -Enter the number of items and backpacks the size of the load procedure automatically for each of the weight an
algorithm.tar
- 一个算法教案，包括多精度数值处理、排列组合、枚举法、递归与回溯法、贪婪法等在章节-An Algorithm for lesson plans, including multi-precision numerical processing, permutation and combination, enumeration, recursive and backtracking, greedy method, such as in the
migong
- 用回溯法求解迷宫问题，就是按某种方式走，不行的话就往后退，试试别的路，直到走通为止。-With backtracking maze solving problems is by some way away, if not就往retreat, try other way until the pass so far away.
jiqishejixiuzheng
- 某机器由n个部件组成，每一个部件可从 个供应商那里购得。设 是从供应商 那里购得的零件 的重量， 为该零件的成本。试设计一个回溯算法，给出总成本不超过 的最小重量机器设计，并分析算法的复杂度。-A machine by the n-components, each component can be purchased where suppliers. Set is purchased from suppliers of parts of
01beibaozhenghechengxu
- 背包问题非常有用的程序代码打包，包括贪心，回溯，动态规划-Knapsack problem is very useful package of program code, including greedy, backtracking, dynamic programming
ZJHS
- 这是一个子集和数问题的递归回溯解法.能在TC和VC++6.0上运行.已经加入注释-This is a subset of the problem and several recursive backtracking method. In TC and VC++ 6.0 run. Have joined the Notes
Knap2
- knap2 背包问题非递归，运用栈及回溯算法优化了一下，可以找到所有满足条件的解。 如果遇到什么问题，请发邮件至horsewhite32@hotmail.com,笔者将不胜感激 uuhorse-non-recursive knap2 knapsack problem, the use of stack and the backtracking algorithm to optimize the look, you can f
queen
- 此程序源码为回溯算法中的n后问题，可以根据需要更改棋盘大小。已加入时间函数，可以分析不同棋盘规模下的运行时间。-This procedure for the backtracking algorithm source of n after the problem may be based on need to change the board size. Has joined a function of time, can be ana
0-1
- 掌握回溯法的应用 用回溯法求解0-1背包问题。 -Backtracking to master the application of retrospective method with 0-1 knapsack problem.
suanfa
- 第1章 算法引论 第2章 递归与分治策略 第3章 动态规划 第4章 贪心算法 第5章 回溯法 第6章 分支限界法 -Chapter 1 Introduction Algorithm Chapter 2 Recursion and sub-rule strategy in Chapter 3 Dynamic Programming Chapter 4 greedy algorithm in Chapter 5 Ba