搜索资源列表
suanfafenxiyusheji
- 算法分析与设计课程设计基于贪心法的装箱问题设计报告
tanxinxiang
- 算法分析与设计课程设计基于贪心法的装箱问题设计报告
ACM竞赛算法
- 此文档是ACM（国际大学生程序竞赛）很全的算法学习文档，包含枚举，贪心，动态规划，几何，图论等许多算法，相信对你会有很大帮助。
suanfashiyanbaogao
- 算法设计实验报告 递归与分治 和贪心算法-Recursive algorithm design lab report and the greedy algorithm with sub-rule
yuhen
- 用贪心算法解题: 设n是一个正整数。现在要求将n分解为若干互不相同的自然数的和，且使这些自然数 的乘积最大。-Greedy algorithm with problem-solving: Let n be a positive integer. N decomposition will now require a number of separate and natural number, and make them the product of the largest natural nu
TSPproblems
- 解决TSP问题的几种算法 模拟退火法 遗传算法 贪心算法等-To solve the problem of several TSP algorithm simulated annealing greedy algorithm such as genetic algorithms
Prim
- 用贪心算法，求解最短路径问题； 通过根据当前的最优情况，选择最好的节点；-greedy alogith ,in order to get the best result for the station of the matter
11
- 算法设计报告，有5种算法，动态规划，贪心法，回溯法，递归，分支界限法
tanxinfaqiujiezhaolingqian
- 利用会贪心算法求解超市系统的找零钱问题。-liyongtanxinsuanfashixianchaoshixitongdezhaolingqianwenti。
knapsackproblem
- 贪心算法，回溯法，动态规划算法解决0-1背包问题-Greedy algorithms, backtracking, dynamic programming algorithm to solve 0-1 knapsack problem
SUANFAPPT
- 常用的算法设计策略(包括分治策略、动态规划、贪心策略、回溯法、随机算法等) 算法复杂度分析方法(计算迭代次数、使用递归方程、频度分析等) -Commonly used algorithm design strategies (including the strategy of divide and conquer, dynamic programming, greedy strategy, backtracking method, random algorithm) algorithm
algorithm1
- 动态规划可以找到最优子结构特征，贪心算法用于求解最优化问题-Dynamic programming can be found in sub-optimal structural characteristics greedy algorithm for solving optimization problems
algorithms
- 算法导论英文版第二版；从简单的基本算法到难的贪心算法或NP难题；-Introduction to Algorithms, Second Edition English basic algorithms from simple to difficult greedy algorithms or NP-hard
1
- 马踏棋盘贪心算法，时间复杂度小，效率高,-Horse riding chessboard greedy algorithm, the time complexity, high efficiency,
dingdianfugai
- 最小顶点覆盖问题的贪心算法，源程序代码，精心编写的，可以运行-Minimum vertex cover problem of greedy algorithm, the source code, well-written, can run
package
- 改代码实现的是用贪心算法解决0—1背包问题，用c++实现。-Change the code is to solve 0-1 knapsack problem with the greedy algorithm, using c++ implementation.
Greedy-algorithm
- 贪心算法解决木棒覆盖最多点的问题，食用一定量定长的木棒，使其覆盖尽可能多的点。-Solve the problem of sticks to cover some greedy algorithm
first
- 贪心算法，哈夫曼编码 ，最优编码二叉树。(Greedy algorithm, Huffman coding, optimal coding two trees.)
graph_coloring
- 基于matlab的图着色程序，算法为贪心算法，将节点按照度从大到小排序，排序后先给度大的着色。(The graph coloring program based on MATLAB algorithm, greedy algorithm, the node according to the degree from large to small order, ranking after the first to a large degree of coloring.)
STL、贪心
- 在里面详细介绍了STL、贪心算法。并且包含一些具体的事例。(The STL and greedy algorithms are introduced in detail. And contains some specific examples.)