搜索资源列表
Horse
- 马跳棋盘的回溯法程序,基于mfc,有可视化界面,可以演示程序的运行过程-Horse jumping board of backtracking procedure, based on the mfc, has visualization interface, can run the course of the demo program
beibao
- 用回溯法求解0-1背包问题 用vc++实现 包含完整源代码 经过测试成功!-Retrospective method with 0-1 knapsack problem with vc++ Achieve that contains a complete source code has been tested successfully!
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
CSP
- CSP算法java实现,并且有回溯法和mcSearch两种方法实现,结构好,容易懂-CSP algorithm java to achieve, and back and two ways to achieve mcSearch, structure, and easy to understand
5th_chapter
- ,《算法设计与分析》王晓东编著,第五章回溯法,课本例子代码实现 -, Algorithm Design and Analysis edited by Wang Xiaodong, chap backtracking, textbooks examples of code to achieve
Loading
- 用回溯法求解装载问题,对有解的装载问题,采用的策略可以得到最优装载方案 (1)首先将第一艘轮船尽可能装满; (2)然后将剩余的集装箱装上第二艘轮船-With back problems loading method, loading of the solvability problem, using the optimal strategy can be loaded with the program (1) First of
01beibao
- 01背包问题,里面有四种算法,分别为动态规划,分支限定发,回溯法和谈新算法!-01 knapsack problem, there are four kinds of algorithms, dynamic programming, respectively, branch limit hair, the new algorithm backtracking peace!
Knapsack
- 我自己做的一个0-1背包问题程序 用回溯法 做的 望大家分享 请指正-I own a 0-1 knapsack problem with retroactive law procedures do hope to share, please correct me
map4
- 用回溯法解决四色图问题,内有实验报告,源代码,以及程序说明的文件 和可执行的exe文件-err
subsum
- 回溯法求子集和问题, 在回溯过程中利用了剪枝 -The back track method to solve the sub sum problem
nquenehuisufa
- n皇后的回溯法遍历问题的实验报告,包括算法描述,源码-nquenewenti
Queue
- 用回溯法实现n皇后问题,c++语言编写,调试通过。包含代码和完整文档说明-By backtracking the question of the realization of n queen, c++ languages, debugging through
design
- 回溯法,动态规划法,遗传算法求解 tsp问题(课程设计报告)-Backtracking, dynamic programming method, genetic algorithm tsp issues (curriculum design report)
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
WorkAssignment
- 算法设计与分析中,用回溯法解决工作分配问题,有较详细的源码解析。-Algorithm design and analysis, the distribution of work by backtracking to solve the problem, there is a more detailed source code analysis.
01bag
- 用蛮力法,回溯法,分支限界法求解背包问题-With the brute force method, backtracking, branch and bound method for solving knapsack problem
beibaowenti
- 算法实验C++编程用回溯法解决01背包问题-Experimental C++ programming algorithm with backtracking to solve 01 backpack
0_1bag
- 此程序是用回溯法解决01背包问题,可以运行成功,欢迎下载-This program is backtracking to solve 01 knapsack problem, you can run successfully, please download
pack_of_four_algorithms
- 01背包四种算法实现:动态规划法,分支限定法,回溯法,贪心算法-01 pack of four algorithms: dynamic programming, branch limit method, backtracking, greedy algorithm
java
- 老师给的用Java编写的算法,包括背包问题, 回溯法等等,适合有基础的学习。-Teacher' s use of algorithms written in Java, including the knapsack problem, backtracking, etc., suitable for basic learning.