搜索资源列表
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,
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
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.
活动安排问题
- 贪心算法实现活动安排问题-greedy algorithm activities arrangements
哈夫曼编码,最优前缀码的贪心算法
- 哈夫曼编码,最优前缀码的贪心算法,平均码长最短,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
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
OnlineAlgorithm
- 在线算法的实现：包括Blance算法、混合型算法及贪心算法-Online algorithms to achieve: Blance algorithm, hybrid algorithm and greedy algorithm
tanxin
- 王晓东《算法设计与分析》（第3版）贪心算法章节的源码 本人参考书中内容自己写的，绝对可以运行-Design and analysis of Wang Xiaodong " algorithm " (Third Edition ) Chapter I greedy algorithm source code reference book to write their own, absolutely can run
conint
- 关于greedy算法的5种例题及实现。 接力 繁忙牧师；视频流；最优赛马；整除15-Five kinds of examples and achieve greedy algorithm. Relay busy pastor video streaming the optimum horse racing divisible by 15
qichejiayou
- 贪心算法解决汽车加油问题，题目为算法设计题目册的贪心算法那一章-Greedy algorithm to solve the problem of vehicle refueling, algorithm design topics titled book chapter greedy algorithm
tanxin
- 使用C语言，利用贪心算法解决经典的旅行商问题，手动输入城市间的距离矩阵，输出最佳路径-Using the C language, the greedy algorithm to solve the classic traveling salesman problem, manually enter the distance matrix between cities, the best path output
myAlgrithms
- 这是贪新算法以及优化的贪新算法实现，简单易懂方便使用，适合初学者学习了解。-This new algorithm is greedy and greedy algorithm optimized implementation of new, simple and easy to use and easy to understand for beginners to learn about.
The-greedy-algorithm
- 贪心算法，最小生成树实例方便初学者学习使用的。-Greedy algorithm, minimum spanning tree instance easy for beginners to learn to use.
1fe6fc9dda8a
- 贪婪算法 子载波分配 MATLAB代码 源代码-Greedy algorithm
Main
- 花费最短时间旅游完全国所有5A级景点，并介绍了相关算法的使用，例如贪婪算法-Take the shortest time to travel the whole country all the 5A level scenic spots, and introduced the use of the related algorithms, such as greedy algorithm
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