搜索资源列表
贪心方法
- 贪心方法解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
tanxinfangfa
- 贪心方法是一种改进了的分级处理方法。它首先根据题意，选取一种量度标准。然后按这种量度标准对这n个输入排序，并按排序一次输入一个量。如果这个输入和当前已构成在这种量度意义下的部分最优解加在一起不能产生一个可行解，则不把此解输入加到这部分解中。这种能够得到某种度量意义下的最优解的分级处理方法称为贪心方法。-greedy method is an improvement of the classification methods. According to its first title Italy,
duioji
- 用贪心法实现多机调度的问题。用C语言编写的-greedy method used to achieve multi-machine scheduling problems. C language prepared by the
各种排序算法
- 各种常用的排序算法源程序,包括快速排序/归并排序/带限期的排序以及贪心法的实现程序-various commonly used algorithm source, including rapid sequencing / merge sorting / ranking with the deadline and the greedy method to achieve procedures
贪婪法解最短回路问题
- 一个用变形贪婪法解货郎回路的C程序代码 思想 1．选择一条最短的边作为部分解。 2．选择一条最短的且将之加入到部分解不形成回路的边。 3．重复第2步，直至所有的结点都包含在部分解中。-deformation with a greedy method for the Traveling Salesman circuit C code ideological one. Choose a minimum as part of the solution side. 2. Choose one of th
背包问题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
Image-Segmentation
- 一个基于图形的高效图像分割算法，包括论文及相应的源代码。-This paper addresses the problem of segmenting an image into regions. We define a predicate for measuring the evidence for a boundary between two regions using a graph-based representation of the image. We then develo
duo
- 名称叫做多边形游戏,是算法设计技巧与分析中经常会遇到的一类问题,主要是由贪心法来解决-Name of the game called the polygon is algorithm design techniques and analysis of a class of frequently encountered problems, mainly by the greedy method to solve
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
tanlanfa
- 设计一个小程序运用贪婪法解决实际问题，并且计算一些简单运算.-Design a small program to use the greedy method to solve practical problems, and calculation of some simple calculations.
bowuguan
- 对大型活动的安排，贪心法，先对结束时间排序在依次取出最大子集。-Arrangements of large-scale activities, greedy method, first the end of time in order to sort out the biggest subset.
The_design_of_computer_algorithms
- 全书从算法设计和算法分析的基本概念和方法入手，系统介绍了算法设计方法与分析技巧。全书分为3个部分：第一部分介绍算法的基本概念、算法的数学基础以及算法复杂度分析；第二部分针对排序问题和图的问题，讨论各种已有的算法，并介绍常用的算法设计方法包括分治法、贪心法、动态规划法、回溯法和分支限界法，并介绍了计算的复杂性以及NP完全问题；第三部分讲述并行计算模型和并行算法设计技术。书中每章后面都附有一定数量的习题，帮助读者理解和掌握书中的内容。-Book from the algorithm design a
greedy
- 贪心法中最优量度标准的选择,是ACM队训练时看到讲义之一。-Greedy method to choose the best measure of the standard is ACM training lectures to see one.
Greedy
- Greedy method in c/c++.
The-principle-of-greedy-method-
- 关于程序设计编程中的有关贪心算法的知识和一些理论例题！-The function is about the principle of greedy method !
Greedy-algorithm
- 贪心算法法，算最优活动安排，主要体现贪心算法思想。-The greedy method, the optimal arrangements
Greedy
- Greedy method in c/c++.
greedy
- 贪心法解决背包问题 可自己设置物品数量和背包总容量-Greedy method to solve the knapsack problem and the number of items can set up their own backpack with a total capacity
Greedy-algorithm
- 贪心算法法，算最优活动安排，主要体现贪心算法思想。-The greedy method, the optimal arrangements