搜索资源列表
computerdisign-C
- 算法的设计方法(C程序):一、迭代法 二、穷举搜索法三、递推法 四、递归五、回溯法 六、贪婪法 -algorithm design method (C program) : 1, 2 iteration, the exhaustive search method three, four recursive method, recursive 5, backtracking 6, greedy algorithm
OI
- 用多种算法解决0－1背包问题，包括回朔法，动态规划，贪心算法等-algorithm used to solve a variety of 0-1 knapsack problem, including the retrospective method, dynamic programming, greedy algorithm
单源点最短路径贪心算法
- 单源点最短路径贪心算法：用到Dijkstra算法，-single source shortest path greedy algorithm : use Dijkstra algorithm,
beibao
- 程序中的beibao1函数采用了贪婪算法的另一种写法，beibao函数是以前的代码，用来比较两种算法-Process beibao1 function greedy algorithm used another wording, beibao function is the previous code, used to compare two algorithms
greedy
- 数学经典算法应用:贪婪算法的应用实例-Application of the classical algorithm: the application of the greedy algorithm
Minoux_greedy_algorithm
- Minoux’s greedy algorithm is a method of a heuristic solution for the network design with linear separable costs.
greedy
- 贪婪算法，可以用于资源分配等许多数学问题和工程问题中-Greedy algorithm
tanlansuanfa
- 这是一个ACM的算法，叫贪婪算法，内含PPT和实例代码，希望对喜欢ACM的同学有所帮助！-This is an ACM algorithm, called greedy algorithm, containing the PPT and examples of code, and want to help students like the ACM!
KnapSack
- Fractional knapsack problem, Greedy algorithm
pack_of_four_algorithms
- 01背包四种算法实现:动态规划法,分支限定法,回溯法,贪心算法-01 pack of four algorithms: dynamic programming, branch limit method, backtracking, greedy algorithm
The_greedy_algorithm_analysis_and_design_tutorial.
- 算法分析设计之贪心法教程The greedy algorithm analysis and design tutorial-Analysis and design of the greedy algorithm tutorial The greedy algorithm analysis and design tutorial
greedyknapsack
- 贪心算法之背包问题。背包问题的贪心算法要求按照单位容量效益值的高低的量度标准进行排序，然后再分级选取，求得最优解。实现此算法，物品个数，每件物品的效益值，容量值，背包容量值都由键盘输入；输出结果要有每件物品的详细信息。-Greedy algorithm for knapsack problem. Knapsack problem greedy algorithm efficiency requirements in accordance with the unit value of the ca
greedyjs
- 贪心算法之带有限期的作业排序。应用贪心设计策略解决操作系统中单机、无资源约束且每个作业可以在等量的时间内完成的作业调度问题。-Greedy Algorithm for Scheduling with deadline. Application greedy single operating system design strategy to solve, no resource constraints and each job can be completed within the same a
currency-exchange
- 利用C++实现货币兑换的贪心算法，取得货币兑换的最优解。-Using C++ implementation of the greedy algorithm currency exchange, currency exchange obtained the optimal solution.
Greedy-algorithm
- greedy algorithm:Applications-Kruskal, Prim , Dijkstra, Backpack
DuongThangKhongGiaoNhau
- The Greedy Algorithm. Implement the greedy algorithm. Input from a structured file. It will produce the output file.
algorithm
- 熟悉C/C++语言的集成开发环境；通过本实验加深对分治法、贪心算法的理解。掌握贪心算法、动态规划和回溯算法的概念和基本思想，分析并掌握"0-1"背包问题的三种算法，并分析其优缺点。-Master the greedy algorithm, the dynamic programming algorithm and back of the concept and basic thought, analysis and master "0-1" knapsack problem three algo
tanxinsuanfa
- 贪心算法计算货币数量，计算出不同面值所需要的张数，最优方案-Greedy algorithm to calculate the quantity of money, to calculate the number of sheets of different denominations, the optimal solution
Algorithm-analysis-and-design
- 计算机实验室 内容： 1、分治法，maxmin算法 2、动态规划，矩阵连乘 3、贪心法， 1）背包问题，2）装载问题 4、回溯法，N皇后问题的循环结构算法和递归结构算法。-Computer laboratory content: 1, partition method, maxmin algorithm 2, the dynamic planning, LianCheng matrix 3, greedy method, 1) knapsack probl
Greedy
- This is Greedy Algorithm implementation.