搜索资源列表
Greed_Tsp
- 用贪心算法解决旅行商问题，能运行的，是本科四年级的软件课程设计源码！-Use greedy algorithm to solve traveling salesman problem, will be able to run is the fourth year undergraduate curriculum design of the software source code!
define_the_latter_table.txt
- 根据贪心算法，来求解最小生成树； 这种情况，可能求不不全局最优解，但是，可以求出当前情况下的最优解；-According to greedy algorithm to solve the minimum spanning tree this situation, it may not seek the global optimal solution is not, however, you can find the optimal
TSP-MST
- 最小生成树的思想应用于TSP问题的求解，贪心算法的实际应用。-Minimum Spanning Tree thinking applied to TSP problem solving, the practical application of greedy algorithm.
huffman
- 哈夫曼编码,最优前缀码的贪心算法,平均码长最短-Huffman codes, optimal prefix code of the greedy algorithm, the shortest average code length
Cargobin-packingproblem.jsp
- 首先，打开MATLAB编辑器,输入该文件中程序码，把文件保存到MATLAB当前目录并命名为zhuangxiang.m,只需在命令窗口中输入zhuangxiang,按回车键，根据提示输入，便可解决贪心算法中货船装箱问题，以求得最优解。 -First of all, open the MATLAB editor, enter the file, program code, save the file to the MATLAB curr
Algorithm
- 算法分析与设计的讲义 内容有动态规划，分制思想，贪心算法等-Algorithm analysis and design of the lecture content of dynamic programming, sub-system thinking, greedy algorithm
01pack
- 用动态规划，贪心算法等算法实现01背包问题-Using dynamic programming, greedy algorithm knapsack problem algorithm 01
FastJob
- FASTJOB 贪心算法：输入作业收益与截止日期后，可得出作业执行顺序-FASTJOB greedy algorithm:after Enter the operating income and the deadline, the execution order of operations can be drawn
sffx
- 算法分析实验 包含背包算法，硬币问题，贪心算法-Algorithm analysis experiments including knapsack algorithm, coins, greedy algorithm
park
- 是公园路径搜索的c++实现方法，功能比较简单，是课程设计的。用到了迪杰斯特拉算法和贪心算法求最短路径-Is a park path search c++ implementation method is relatively simple functions, curriculum design. Use the Dijkstra algorithm and the greedy algorithm for the shortest p
tx
- 这是一个关于贪心算法的一些例子，里面包含了源代码，请仔细研究-some example
qichejiayou
- 一辆汽车加满油后可行驶n公里，旅途中有若干个加油站，设计一个有效算法，指出应在哪些加油站停靠加油，使沿途加油次数最少，对于给定的n和k个加油站位置，编程计算最少加油次数。 可以利用贪心选择性质来求解汽车加油问题，也就是所求问题的整体最优解可以通过一系列局部最优的选择，即贪心选择来达到。这是贪心选择算法可行的第一个基本要素，也是贪心算法与动态规划算法的主要区别。在动态规划算法中，每步所做的选择往往信赖于相关子问题的解，因而只有在解出相
greedyalgorithm
- 贪心算法是一种更为高效的算法，程序已全部通过-greedy algorithm
greedyjs
- 贪心算法之带有限期的作业排序。应用贪心设计策略解决操作系统中单机、无资源约束且每个作业可以在等量的时间内完成的作业调度问题。-Greedy Algorithm for Scheduling with deadline. Application greedy single operating system design strategy to solve, no resource constraints and each job can
suanfafenxi
- 算法分析课的实验-算法分析与设计\贪心算法-最优装载
thegreedyalgorithmusinggeneticalgorithmssolveknaps
- 详细的讲述了贪心算法和遗传算法相结合去求解NP难题，背包问题。-Greedy algorithm described in detail and the combination of genetic algorithms to solve the NP problem, knapsack problem.
greed
- 带有期限和效益的单位时间的作业排序贪心算法。作业已按效益值递减的顺序排好，依次输入各作业的期限值，要求按顺序输出最优解。-With the duration and effectiveness of the unit time Scheduling greedy algorithm. Operating efficiency values have been decreasing order, the ord
TSPSA
- 贪心算法和退火模拟算法的MATLAB程序，贪心算法仅是在某种意义上的局部最优解。(Greedy algorithm MATLAB procedures, greedy algorithm is only in a sense of the local optimal solution.)
GREEDY MAX-IS
- 最大独立集的贪心算法简易实现，可以快速求取节点数量较少的最大独立集问题。(An approximated greedy algorithm for Maximum Independent Set Problem)
贪心算法
- 贪心算法的详细说明，哈哈哈哈哈哈哈哈哈哈哈(Greedy algorithm is described in detail)