搜索资源列表
xinchengxu
- 包括GRAY码，工作分配问题，会场安排，石子，行数字三角形，最长递增子序列和最小重量机器算法。利用动态规划、回溯法和贪心法-including GRAY code, work assignment, venue arrangements, gravel, and digital triangle, the longest sequences and increase the minimum weight machine algorithm. Using dynamic programming,
贪心方法
- 贪心方法解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
caitou
- 贪心算法解决分割问题 给定一定的宽度，和N个输入（宽度） 得出最小的宽度-greedy algorithm to solve the segmentation problem must set the width and N input (width) reached the minimum width
背包问题之贪婪算法求解C语言源代码
- 其实原来的程序也是采用了贪婪算法，不过下面程序中的beibao1函数采用了贪婪算法的另一种写法，beibao函数是以前的代码，用来比较两种算法-fact, the original procedure is used in the greedy algorithm, but the procedures below beibao1 function of the greedy algorithm used another way, beibao function of the previous
salesman
- 售货员问题，用贪心法解决问题，虽然比较简单还算可以实现基本要求-salespersons questions, greedy algorithm to solve the problem, although it is relatively simple to achieve fairly basic requirements
tanxinfangfa
- 贪心方法是一种改进了的分级处理方法。它首先根据题意，选取一种量度标准。然后按这种量度标准对这n个输入排序，并按排序一次输入一个量。如果这个输入和当前已构成在这种量度意义下的部分最优解加在一起不能产生一个可行解，则不把此解输入加到这部分解中。这种能够得到某种度量意义下的最优解的分级处理方法称为贪心方法。-greedy method is an improvement of the classification methods. According to its first title Italy,
mataqipan
- 马踏棋盘的贪心算法，8*8棋盘，基本上不用回溯。-horse riding chessboard of the greedy algorithm, 8 * 8 chessboard, basically not retroactive.
BTGame
- AStar2006 的3.变态比赛规则的一种算法.采用贪心算法,效率比较高.-AStar2006 the three. Competition rules perverts the algorithm. Greedy algorithm more efficient.
FileBinds
- 一个用VB写的简易捆绑器（源码），希望大家可以利用此代码扩展一些功能，到时记得发一份副本给我哦（有点贪心^_^）-a summary written by bundling (OSS) in the hope that we can use this code to extend some functions, to remember when a copy made to me, oh (somewhat greedy ^ _ ^)
活动安排问题
- 贪心算法实现活动安排问题-greedy algorithm activities arrangements
zhuangxiang
- 该程序是采用贪婪法编制的一个小程序，解决问题是：有编号为1到n的物品，各物品的体积已知。将其装入体积均为V的箱子里，所用箱子要少-that the procedure was used in the preparation of greedy law a small program to solve the problem is : No. 1 to n items, the volume of goods known. Its size will load all the boxes V, u
食贪蛇
- 这是一个用Java做的食贪蛇小游戏，可以看看哟.-This is a Java so greedy snake eat small game, we can yo.
贪婪法解最短回路问题
- 一个用变形贪婪法解货郎回路的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
哈夫曼编码,最优前缀码的贪心算法
- 哈夫曼编码,最优前缀码的贪心算法,平均码长最短,Huffman codes, optimal prefix code of the greedy algorithm, the shortest average code length
GreedyBag
- 贪心算法求背包问题,分别求出了三种标准1. 按效益值由大到小取物品. 2. 按重量值由小到大取物品 3.按比值pi/wi的值由大到小取物品 其中第3种是最优解-Greedy algorithm for knapsack problem, respectively, obtained three standard 1. Press-effective value of descending and remove things. 2. By weight the value of items
qishixunyou
- 里面用两种方法实现了骑士巡游问题，分别是回溯的方法，和贪心加回溯的方法。-There two ways to achieve a parade Cavalier problems are way back, and greedy plus retrospective approach.
dijkstra_suanfa
- dijkstra 这是用C语言实现的贪心算法 看这个程序前最好先看看图形说明-Dijkstra this is achieved using C language greedy algorithm to see this process take a look at the graphics before the best descr iption
bowuguan
- 对大型活动的安排，贪心法，先对结束时间排序在依次取出最大子集。-Arrangements of large-scale activities, greedy method, first the end of time in order to sort out the biggest subset.
The-greedy-algorithm
- 贪心算法，最小生成树实例方便初学者学习使用的。-Greedy algorithm, minimum spanning tree instance easy for beginners to learn to use.
greedy-algorithm
- 克鲁斯卡尔算法(Kruskal s algorithm)是两个经典的最小生成树算法的较为简单理解的一个。这里面充分体现了贪心算法的精髓。-Kruskal algorithm (Kruskal' s algorithm) is relatively simple to understand one of two classic minimum spanning tree algorithm. Inside this fully reflects the essence of greedy a