搜索资源列表
贪心方法
- 贪心方法解0/1背包问题,构造一个物品类,调用类方法对背包进行排序,核心代码已给出-greedy method for 0 / 1 knapsack problem, a structural categories of goods, the category called right backpack method for sequencing, the core code has been given
贪心算法球园排列问题
- 贪心算法球园排列问题，算法设计与分析课程的作业。-greedy algorithm with the ball park, algorithm design and analysis programs work.
生成最短路径贪心算法
- 《计算机算法基础》（华工版）关于单源点最短路径生成最短路径贪心算法；-"computer algorithms" (laborers version) on the single-source shortest path generation Shortest Path greedy algorithm;
Kruskal算法：(贪心)
- Kruskal算法：(贪心)-Kruskal algorithm : (greedy)
单源点最短路径贪心算法
- 单源点最短路径贪心算法：用到Dijkstra算法，-single source shortest path greedy algorithm : use Dijkstra algorithm,
贪心法
- 用贪心法解决TSP问题.输入数据可求得所要的最值的结果.-greedy algorithm used to solve TSP. Input data can be obtained by the most value to the results.
贪心算法
- 模式识别中的贪心算法，是根据分配篮球队员的简单条件做的-pattern recognition of greedy algorithm is based on the distribution of basketball players do the simple conditions
贪心法求任务调度问题
- 西电算法课的贪心部分上机试验题目！
生成最短路径贪心算法
- 《计算机算法基础》（华工版）关于单源点最短路径生成最短路径贪心算法；-"computer algorithms" (laborers version) on the single-source shortest path generation Shortest Path greedy algorithm;
单源点最短路径贪心算法
- 单源点最短路径贪心算法：用到Dijkstra算法，-single source shortest path greedy algorithm : use Dijkstra algorithm,
贪心算法
- 模式识别中的贪心算法，是根据分配篮球队员的简单条件做的-pattern recognition of greedy algorithm is based on the distribution of basketball players do the simple conditions
贪心算法球园排列问题
- 贪心算法球园排列问题，算法设计与分析课程的作业。-greedy algorithm with the ball park, algorithm design and analysis programs work.
贪心
- 贪心算法的应用：对地点运输的贪心算法实现(Application of greedy algorithm)
贪心算法
- 贪心算法（又称贪婪算法）是指，在对问题求解时，总是做出在当前看来是最好的选择。也就是说，不从整体最优上加以考虑，他所做出的是在某种意义上的局部最优解。(The greedy algorithm (called greedy algorithm) refers to, in problem solving, always seems to be made in the best choice. That is to say, do not
贪心算法背包问题
- 一个简单贪心算法的研究，背包问题，供大家浏览参考。(A simple greedy algorithm research, knapsack problem, reference for browsing.)
贪心算法 简单问题研究
- 关于贪心算法的最优安排和稍微复杂的研究，文中给出两个小例子。(About the greedy algorithm is the optimal arrangement and study a little more complicated, two small example is given in the paper.)
部分背包的贪心算法实现
- 通过贪心算法实现装进背包物品价值最大化，具体步骤是依次选择价值密度最大的物品放入背包(Through greedy algorithm to maximize the value of goods loaded into backpacks.)
贪心法求背包问题
- 贪心法求背包问题，如何选择使得背包中物品价值最大(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, n
贪心算法4.8宿营地
- 贪心算法宿营地问题 /*考察路线有n个地点作为宿营地，宿营地到出发点的距离依次为x1,x2,...xn,且满足 x1<x2<x3<x4，每天只能前进30千米，任意两个宿营地相距不超过30，每个宿营地只住 一天，求宿营天数最少*/(Greedy The expedition route has N locations as camps, and the distance from the campsite to the