搜索资源列表
背包问题2 递归
- 一个0-1背包问题的C++实现，背包的容量为t，各物品的重量分别为w1，w2。。。wn，找一个能装下最大重量的物品组合，用递归形式的贪心法实现-a 0-1 knapsack problem of C achieved, the capacity for backpack t, the weight of the items were w1, w2. . . Wn, one can find the largest installed under the weight of goods portf
01package
- 01背包问题的贪心法源代码 供给有需要的参考-01 knapsack problem greedy algorithm source code
tanxin
- 贪心法的基本思路： ——从问题的某一个初始解出发逐步逼近给定的目标，以尽可能快的地求得更好的解。当达到某算法中的某一步不能再继续前进时，算法停止。-Greedy basic idea:- from the question of a gradual solution of the initial approximation to set targets to as quickly as possible to seek a better solution. When an algorithm
greedyl
- 数据结构与算法，贪心法求最小生成树的c语言描述算法-Data structure and algorithm, greedy method for minimum spanning tree algorithm described in the c language
AlgorithmCode
- C++版本的各类算法源代码，包括动态规划法、分治法、贪心法、回溯法、分支限界法、概率算法-C++ source code version of the various algorithms, including dynamic programming, divide and conquer, greedy method, backtracking, branch and bound method, probability algorithm
suanfaqxf
- 算法实验报告+源代码 实验一 1题 归并排序.cpp 11 实验一 2题 快速排序.cpp 12 实验二1题 贪心法求背包问题.cpp 13 实验二2题 贪心法求最短路径.cpp 16 实验三 动态规划求最短路径.cpp 17 实验四 回溯法求背包.cpp 18-Algorithm+ source code for test lab reports a problem for a merge sort. Cpp 11 question tes
knap
- 分支限界求背包问题相对于贪心法等有很大的优势-fenzhi xianjie beibao
back
- 贪心法求解背包问题。txt文件数据输入与答案输出-The greedy method knapsack problem. txt file data input and answer output
duojidiaodu
- 用贪心法求解多机调度问题。两个机器，调度多项不同时长的作业。每个作业有两个子作业，后一项子作业必须在前一项子作业完成之后才能操作。合理安排这些作业的顺序。使得总时间最短。-Greedy method for solving the multi-machine scheduling problem. Two machines, scheduling a number of long jobs simultaneously. Each job has two sub-operations, afte
Expedition
- expedition,一个很简单的程序，关于贪心法-acm expedition，about
HuffmanCodeTest
- 贪心法实现哈夫曼树，C++实现，可直接运行-a realization of HuffmanTree
test
- 用贪心法解决加油站问题（c语言编写），希望能给大家带来帮助-Greedy method gas station problem
Loading
- 使用贪心法（首先装载最轻的集装箱）实现最优装载算法。-Use the greedy method (first load containers lightest) to achieve optimal loading algorithm.
arrange-meetting-room
- 贪心法 会场安排问题 非常实用 初学者必看的-Greedy method is very useful for beginners venue arrangements must-see
tanxin
- 背包问题是一种NP完全问题，使用贪心法优化解决背包问题。-Knapsack problem is an NP-complete problem, use the greedy algorithm optimization to solve knapsack problem.
The-shortest-path
- 用贪心法和动态规划两种算法求解有向图任意两个节点之间的最短路径，要求给出最短路径的值以及中间路径。-Greedy method and dynamic programming algorithm to solve the two have to figure the shortest path between any two nodes, required to give the value of the shortest path and the middle path.
shortest-road
- 本实例主要是利用贪心法来求解单源点最短路径的判断-This example is the use of the greedy method to solve the single source point of the shortest path of the judge
calabash-master
- 葫芦娃问题的一种解法，利用贪心法和本地搜索，可以得到较好的局部最优解(There are N calabash brothers numbered with 1, 2, ..., N. Each of them has a skill, which they may choose to use or not. So each of them has two states: positive if he uses the skill and negative if not. For example
贪心法求背包问题
- 贪心法求背包问题，如何选择使得背包中物品价值最大(A greedy method for the problem of knapsack)
贪心算法
- 贪心算法（又称贪婪算法）是指，在对问题求解时，总是做出在当前看来是最好的选择。也就是说，不从整体最优上加以考虑，他所做出的是在某种意义上的局部最优解。(Greedy algorithm (also called greedy algorithm) means that when solving a problem, it always makes the best choice at present. That is to say, not considering the overall opt