搜索资源列表
背包问题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
tanlanfa
- 设计一个小程序运用贪婪法解决实际问题，并且计算一些简单运算.-Design a small program to use the greedy method to solve practical problems, and calculation of some simple calculations.
greedyl
- 数据结构与算法，贪心法求最小生成树的c语言描述算法-Data structure and algorithm, greedy method for minimum spanning tree algorithm described in the c language
one
- 求解最短哈密顿回路，先用贪心方法求解一个路径及权值，以此作为回溯剪枝界。-Solving the shortest Hamiltonian circuit, first with the greedy method to solve a path and weight, as a back pruning sector.
suanfa
- 常用算法,为初学者服务,简单易懂,常用的算法设计方法： 数值算法：迭代法、递归法、插值法等； 非数值算法：分治法、贪婪法、回溯法等。-Commonly used algorithms, for beginners service, easy to understand, common algorithm design methods: numerical algorithms: iterative method, the recursive method, interpolation m
huoyun
- 有几种货物，货物i的重量为W(i)价值为P(i).卡车的载重为C。问卡车依次装车如何选择货物最合算。 分别使用贪婪法和动态规划算法解决此问题。 -There are several cargo, goods, i, weight W (i) the value of P (i). Truck load of C. Q followed by loading a truck how to choose your best buy the goods. Respectively, using
CommonAlgorithmDesign
- 常用的算法设计方法集合，主要有迭代法、穷举搜索法、递推法、贪婪法、回溯法、分治法、动态规划法-Algorithm commonly used method of collection, mainly iterative, exhaustive search methods, recursion, greedy method, backtracking, divide and conquer, dynamic programming
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
Greedy
- Greedy method in c/c++.
Greedy-algorithm
- 贪心算法法，算最优活动安排，主要体现贪心算法思想。-The greedy method, the optimal arrangements
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
Geedy
- 用visual c++ 实现的， 借助贪婪法解决团队定向问题的源程序，-The visual c++, with the greedy method to solve the source of team orientation problem,
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
Greedy
- Greedy method in c/c++.
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
6-8
- 贪婪法解决背包问题（局部最优解） 输入项数和重量 输出需要使用的背包数(Greedy method for solving knapsack problem (local optimal solution))