搜索资源列表
basicAlgorithm(pascal)
- 基本算法正稿 包括:一、数论算法;二、图论算法;三、背包问题;四、排序算法;五、高精度计算;六、 树的遍历;七 进制转换;八 全排列与组合的生成;九.查找算法;十、贪心;十一、回溯法框架;十二、DFS框架;十三、BFS框架;十五、数据结构相关算法
多机调度问题
- 多机调度问题要求给出一种作业调度方案,使所给的n个作业在尽可能短的时间内由m台机器加工处理完成。 这个问题是NP安全问题,到目前为止还没有有效的解法。对于这一类问题,用贪心选择策略有时可以设计出较好的近似算法。-machine scheduling problems required to give a scheduling program, so as to the n operations in the shortest possible time by the m-machine proc
suanfabaogao
- 算法设计与分析试验报告,含全部实验源代码,包括贪心法、回溯法、深度优先搜索、分治法等,内容详尽。
DIJKSTR
- 用贪心法解单源最短路径,比较不错的一个算法,大家好好看下
FJS
- 这是学习《计算机算法基础》中贪心方法时写的一个“实现一个更快的作业排序”程序,结果绝对正确!
suanfafenxiyusheji
- 算法分析与设计课程设计基于贪心法的装箱问题设计报告
tanxinxiang
- 算法分析与设计课程设计基于贪心法的装箱问题设计报告
tanxinfa
- 算法设计与分析中的贪心法源程序,用VC编写,应用贪心设计策略来解决操作系统中单机、无资源约束且每个作业可在等量时间内完成的作业调度问题-algorithm design and analysis of the greedy algorithm source, VC preparation, application greedy design strategies to solve the stand-alone operating system, without resource constra
knapsack
- 0—1背包问题的五种解法 1贪心法 2动态规划 3回溯 4分支限界 5遗传算法-0-1 knapsack problem greedy algorithm five Solution 1 2 3 back in 4 dynamic programming genetic algorithm branch and bound 5
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
Fac4_2
- //背包问题贪心解法。该程序已调通,缘自王晓东算法设计-//Knapsack problem greedy solution. The program has been transferred Tong, Xiaodong edge from algorithm design
Fac4_6_2
- 最小生成树问题贪心(Prim)算法,该程序原自王晓东算法设计,程序已调通-Greedy minimum spanning tree problem (Prim) algorithm, the program Xiaodong algorithm since the original design, procedures have been transferred Qualcomm
greedy
- 贪心法的算法,里面有最小生成树算法和单点源最短路径的算法,供大家学习参考-Greedy algorithms, there are minimum spanning tree algorithm and single-point-source shortest path algorithm, for them to learn from reference
2120060366
- 基于贪心策略的五子棋人机对弈,简单的人机对弈,可以应付一下初级选手,算法还有很大改进空间,有兴趣的可以研究一下,有改进的话记得发我一份,一起研究-Gobang greedy strategy based on human-computer game, a simple man-machine game, players can cope with the initial look, there is still much room for improvement algorithm, inter
jihefugai
- 自己编写的集合覆盖问题的贪心近似算法,请指教-I have written a collection of coverage of the greedy approximation algorithm for the problem, please advice
3497
- PKU3497-二分加贪心,具体算法详见代码~-Add PKU3497-II sub-greedy algorithm as detailed in the specific code ~
greedyl
- 数据结构与算法,贪心法求最小生成树的c语言描述算法-Data structure and algorithm, greedy method for minimum spanning tree algorithm described in the c language
AlgorithmDesignAnalysis
- 算法难,递归易,算法皆以递归源,相同处理自循环; 递归处理分和并,分而治之是首选。 DP全,贪心简,最优性质二者兼; DP需要表来填,子问题解表中见; 贪心策略需证明,整体可由局部建。 回溯深,分限广,剪枝函数两边忙; 一边剪左不可行,一边剪右非最优。 分限还需优先级,上界下界来排序; 叶子放在队列里,轮到它时达目的。-Algorithm is difficult, recursive easy recursive algorithm begin with the
hamilton_20
- 贪心和回溯算法来求解HAMILTON回路,可求解20以内-Greedy and backtracking algorithms to solve HAMILTON loop can be solved within 20
english
- 算法导论第二版 英文的 介绍了贪心、动归等算法-Introduction to Algorithms second edition in English describes the greedy algorithms, such as dynamic return