搜索资源列表
match(man&women)
- 回溯法 解决男女匹配问题 八男八女匹配-Backtracking address gender matching eight men and eight women match
hamilton9901
- 给定一个n个结点的连通图,用回溯法求出图中含有的所有哈密尔顿环。包含实验报告。 -given a n nodes in a graph, with retrospective method, the map contains all the Hamilton Central. The report contains experiments.
PackageProblem
- 实现背包问题 package problem 1. 问题描述 假设有一个能装入总体积为T的背包和n件体积分别为w1 , w2 , … , wn 的物品,能否从n件物品中挑选若干件恰好装满背包,即使w1 +w2 + … + wn=T,要求找出所有满足上述条件的解。例如:当T=10,各件物品的体积{1,8,4,3,5,2}时,可找到下列4组解: (1,4,3,2)、(1,4,5)、(8,2)、(3,5,2)。 2. 基本要求 读入T、n、w1 , w2 , … , wn
MagicSquare-huishu
- 当年,学turbo c的时候,书上有一个魔方算法;十年后,一个偶然的应用,我编写了这个回溯法的魔方算法。优点:可以计算n阶魔方的所有可能组合。-year, the school turbo c, the book is a Rubik's cube algorithm; Ten years later, an accidental use, I prepared this retroactive law Cube algorithm. Advantages : can calculate
chinahorse
- 如果車不動,請設計算法:按馬走日的方法但又不能被車吃掉,用回溯法設計馬的走法,並打印出路程.可以做為軟體設計的參考-If the car does not move, please algorithm design : taking Japan by Ma but the car can not be eaten, Design Retrospective with a horse walk, and print out distance. can be used as a reference
c++huisu
- 背包回溯法,初来乍到如有其他问题还请各位多多指教.-knapsack backtracking, just arrived at that if other issues also invited to the exhibitions.
0-1snap
- 算法设计与分析 第五章王晓东版的 回溯法的0-1背包问题 -algorithm design and analysis of the fifth edition of Wang Xiaodong Zhang law retroactively 0-1 knapsack problem
nqueen_LV
- 利用回溯法和随机算法中的拉斯维加斯算法求解n皇后问题。-use of retrospective law and randomized algorithm of Las Vegas algorithm n Queen's problem.
0-1背包的回溯算法
- 回溯法解决0-1背包问题-Backtracking 0-1 knapsack problem solving
回溯法N皇后问题
- 这是计算机算法中的回溯法中的一个经典的问题--N皇后问题!希望对学计算机算法的同学有用!-This is a computer algorithm, the retroactive law on the issue of a classic -- N Queen! Want to learn how to use computer algorithms useful to the students!
字符串全排列
- 用回溯法实现字符串全排列
01beibao.rar
- 01背包问题,里面有四种算法,分别为动态规划,分支限定发,回溯法和谈新算法!,01 knapsack problem, there are four kinds of algorithms, dynamic programming, respectively, branch limit hair, the new algorithm backtracking peace!
subsum.rar
- 回溯法求子集和问题, 在回溯过程中利用了剪枝 ,The back track method to solve the sub sum problem
Knapsack
- 我自己做的一个0-1背包问题程序 用回溯法 做的 望大家分享 请指正-I own a 0-1 knapsack problem with retroactive law procedures do hope to share, please correct me
0-1knapsack_problem
- 0/1背包问题:给定n种物品和一个容量为C的背包,物品i的重量是wi,其价值为vi,0/1背包问题是如何选择装入背包的物品(物品不可分割),使得装入背包中物品的总价值最大?回溯法解决0/1背包问题-0/1 knapsack problem: given n types of items and a knapsack of capacity C, the weight of item i is wi, the value of vi, 0/1 knapsack problem is how to
WorkAssignment
- 算法设计与分析中,用回溯法解决工作分配问题,有较详细的源码解析。-Algorithm design and analysis, the distribution of work by backtracking to solve the problem, there is a more detailed source code analysis.
heshangtiaoshui
- 和尚挑水问题(文件内有详细解释) 主要是回溯法的一个好的实例 自己摸索出来的-Monk carrying water issues (the paper has explained in detail) is primarily a good example of backtracking find their own way out of
jingdiansuanfa
- 经典算法+分支限界法+分治法+动态规划+贪心算法+回溯法-Classical branch and bound algorithm+ France+ divide and conquer dynamic programming+++ backtracking greedy algorithm
01
- c++利用回溯法来实现01背包问题 阶段是:在前N件物品中,选取若干件物品放入背包中; 状态是:在前N件物品中,选取若干件物品放入所剩空间为W的背包中的所能获得的最大价值; 决策是:第N件物品放或者不放; -c++ using backtracking to achieve the 01 knapsack problem Stage: the first N items, select the number of items into the backpack status
c3
- 组合问题 问题描述:找出从自然数1,2,…,n中任取r个数的所有组合。 采用回溯法找问题的解,将找到的组合以从小到大顺序存于a[0],a[1],…,a[r-1]中,组合的元素满足以下性质: (1) a[i+1]>a,后一个数字比前一个大; (2) a-i<=n-r+1。 -Combinatorial problems Problem Descr iption: Find out from the natural numbers 1,2, ..., n r t