搜索资源列表
MaxSubMin
- 用贪心算法编写的有关最大级差问题的java程序-greedy algorithm used in the preparation of the largest differential in java programs
algorithmic
- 是一个介绍常用算法的课件，如贪心算法，规划算法等，试一下吧-Is a commonly used method to introduce the courseware, such as the greedy algorithm, planning algorithms and so on, try it
4-7you
- 计算机算法的多处最优服务次序问题，用贪心算法实现-Computer algorithm of multiple optimal service order issues, with greedy algorithm
tanxinsuanfa
- 本文章介绍了贪心算法的过程及运用C语言的实现-This article describes the process of greedy algorithm and the realization of the use of C language
zuixiaoshengchengshu
- 使用贪心算法编程，求解最小生成树问题,并给出详细的过程！-The use of greedy algorithm programming, minimum spanning tree problem solving, and gives details of the process!
ShortEst
- matlab最短路的贪心算法，用VC++实现，把ShortEst.dll复制到matlab工作文件夹运行（先要运行mex-setup，关联VC与MATLAB）调用方法如 a = [-1,2,3 2,-1,4 3,4,-1] ShorstEst(a) 即可-matlab most short-circuit the greedy algorithm, using VC++ to achieve, and copy it to ShortEst.dll working folder m
bag
- 用Visual C++编写的程序，利用贪心算法实现背包问题-Using Visual C++ to prepare the procedures for implementation the use of greedy algorithm knapsack problem
tanxin
- 算法分析中的实例，简单的贪心算法用于求解此类问题-Examples of algorithm analysis, the simple greedy algorithm for solving such problems
RWXML8
- 分别用贪心算法和启发式算法对测试用例集进行了最小化。-the Greedy and Heuristic is used to minimized the test suite.
tanxin
- 算法设计课程设计中的贪心算法，用c++实现代码-Algorithm design in the curriculum design of the greedy algorithm to achieve 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 solution under the current si
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 current directory and named zhuang
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 path
tx
- 这是一个关于贪心算法的一些例子，里面包含了源代码，请仔细研究-some example
qichejiayou
- 一辆汽车加满油后可行驶n公里，旅途中有若干个加油站，设计一个有效算法，指出应在哪些加油站停靠加油，使沿途加油次数最少，对于给定的n和k个加油站位置，编程计算最少加油次数。 可以利用贪心选择性质来求解汽车加油问题，也就是所求问题的整体最优解可以通过一系列局部最优的选择，即贪心选择来达到。这是贪心选择算法可行的第一个基本要素，也是贪心算法与动态规划算法的主要区别。在动态规划算法中，每步所做的选择往往信赖于相关子问题的解，因而只有在解出相关子问题后，才能做出选择。而在贪心算法中仅在当前状态下做出最
greedyalgorithm
- 贪心算法是一种更为高效的算法，程序已全部通过-greedy algorithm