搜索资源列表
各种排序算法
- 各种常用的排序算法源程序,包括快速排序/归并排序/带限期的排序以及贪心法的实现程序-various commonly used algorithm source, including rapid sequencing / merge sorting / ranking with the deadline and the greedy method to achieve procedures
analysys-and-design-of-algorithm-ppt
- 我上课用的计算机算法设计与分析的电子教案，内容包括了最基本的分治法，贪心法，动态规划法，-I class computer algorithms used in design and analysis of electronic lesson plans, including the most basic sub-rule law, greedy method, dynamic programming method,
Knapsack_V6.0
- vc实现的0-1背包问题，一般递归方法，动态规划方法和贪心方法-vc achieved 0-1 knapsack problem, the general recursive method of dynamic programming methods and greedy method
greedymethod
- 贪婪算法的具体例子 有个国有中型企业，接到一批需要加工零件的订单，员工们非常高兴，可是高兴之后却发现问题了，原来这家企业能够加工这批零件的机床有限，如果仅仅为了这批加工任务而新添机床的话，那么既不合算也不必要，因为加工完这批零件后很可能这些机床又要闲置起来，所以大批量购买肯定不行，但这批订单又必须要完成，那么这么办呢？很想请你帮忙设计一个安排加工任务，使得完成这批订单所需要使用的机器数量最少-An example of greedy method
SpecialPacket
- 特殊的0-1背包问题求解，使用贪心法求解，有多个贪心策略。-0-1 Knapsack Problem particular, the use of greedy method, a number of greedy strategy.
shiyan4
- 使用贪心法实现最优加油问题，给定距离可加油站的位置及距离，确定加油站的次序！-Using the greedy method to achieve optimal fuel problem, given the location and distance from the station to determine the order of the gas station!
Prim
- 算法，写的prim算法，用的是贪心法，里面还有用到最小生成树来写的-Algorithm, written in the prim algorithm using a greedy method, there is also used to write the minimum spanning tree
Dijkstra
- 最短路径，从一个顶点到其余各个顶点的最短路径，贪心法-The shortest path from one vertex to every other vertex of the shortest path, greedy method
beibao
- 用贪心法解决背包问题：设有不同价值、不同重量的物品n件，求从这n件物品中选取一部分物品的方案， 使选中的物品的总重量不超过指定的限制重量，但选中物品的价值之和最大。-Knapsack problem with a greedy method to solve: with different values, different weights of items n pieces, find items from n items in the select part of the program
notsp
- 贪心法遍历一群点的最短路径 不会原点 进行了小优化-A group of greedy method through the origin point of the shortest path is not optimized for small
knapsack_greedy
- 贪心法解背包问题，你懂得。。。。。。。20个子真麻烦-Greedy method to solve knapsack problem, you know. . . . . . .
6
- 贪心法解活动安排问题(计算机算法设计与分析)实验报告-Greedy method for solving activities arrangements ( computer algorithm design and analysis )
backpack
- 动态规划实现0-1背包问题和贪心法实现背包问题-Dynamic programming to realize knapsack problem and greedy method to realize knapsack problem
GreedTsp
- 用贪心方法计算TSP路径，用的是matlab-TSP path with the greedy method, using matlab
exp3
- 贪心法解背包问题的c语言源程序 编译通过-Greedy method solving knapsack problem
greedy
- 贪心法解决背包问题 可自己设置物品数量和背包总容量-Greedy method to solve the knapsack problem and the number of items can set up their own backpack with a total capacity
Knapsack
- 用贪心法求解背包问题。 构造方法，求解背包问题。参数kweight指定背包重量，数组arts提供若干物品-Knapsack problem using greedy method.
MaxLoading
- 最大装载问题，，采用贪心法实现，希望对大家有所帮助-The maximum loading problem ,, using greedy method to achieve, we hope to help
OptimalizingLoading
- 最优装载问题，采用贪心法实现，希望对大家有所帮助-Optimal loading problem, using the greedy method to achieve, we hope to help
Line-up-for-water
- 经典的贪心法问题——排队打水问题，这对研究数据结构的人来说是打好基础的好东西-The classic problem greedy method- queue to fetch water problem, which those who study the data structure is to lay the foundation of a good thing