搜索资源列表
beibaowenti
- 背包的问题求解，用贪心和遗传算法界的，非常好用，大家下载哦-Knapsack problem-solving, with greedy and genetic algorithm community, very easy to use, we download oh. . .
knight
- 骑士漫游的改进算法，回溯算法加贪心选择策略，n最大可以到128-Knight improved roaming algorithms, backtracking algorithms greedy selection strategy increases, n the greatest can go to 128
11
- 算法设计报告，有5种算法，动态规划，贪心法，回溯法，递归，分支界限法
algorithm_report
- 算法设计报告5个重要算法，包括贪心，回溯，动态规划，分支限界，分治法，每种算法介绍及实例问题代码，C++成功编译运行-Algorithem report including 5 Major algorithms
knapsack
- 背包问题算法 - 贪心法，递归法和动态规划法分别解决-Three solutions to Knapsack problem: the integer knapsack problem solution, fractional knapsack solution and DDG solution
famousalgorithmcollection
- <经典算法合集>其中包括: 最小生成树 MD5加密 LZW压缩 josephus 乘法表 积分 枚举 基数转换 矩阵问题举例 求解质数 圆周率的求法 改进的快速排序法 几种插入排序法 水仙花数 迷宫生成器 生命游戏 递归 回溯 贪心 动态规划 排序算法-" Classical algorithm Collection> These include:
AlgorithmCode
- C++版本的各类算法源代码，包括动态规划法、分治法、贪心法、回溯法、分支限界法、概率算法-C++ source code version of the various algorithms, including dynamic programming, divide and conquer, greedy method, backtracking, branch and bound method, probability algorithm
Run
- 一个TSP问题的贪心搜索算法,用于计算网络路由的经典算法-A greey algorithm of TSP problem
Arithmetic
- 用JAVA完成的0-1背包算法，一共用了四种算法，包括贪心，分治，动态规划，回溯。把工程导入ECLIPSE下就可以了。-JAVA finished 0-1 with a knapsack algorithm, a share of the four algorithms, including greedy, divide and conquer, dynamic programming, backtracking. To work on it under into ECLIPSE.
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
Prim
- 算法特点：该算法的特点是当前形成的集合T始终是一棵树。将T中U和TE分别看作红点和红边集，V-U看作蓝点集。算法的每一步均是在连接红、蓝点集的紫边中选择一条轻边扩充进T中。MST性质保证了此边是安全的。T从任意的根r开始，并逐渐生长直至U=V，即T包含了 C中所有的顶点为止。MST性质确保此时的T是G的一棵MST。因为每次添加的边是使树中的权尽可能小，因此这是一种"贪心"的策略。 -Algorithm characteristics: the algorithm is characteriz
the_beautiful_algorithm_of_C_and_VC
- C C++实现的一些著名的算法，包括贪心、分治-C++ realization of some famous algorithm, including greed, partition, etc
tanxinfadanyuanzuidaunlujing
- 实现贪心法单源最短路径 绝对正确 算法设计与分析中贪心法的应用 环境为VC6.0-failed to translate
algorithm-design
- ACM算法入门课件，很适合初学者，包括枚举，贪心，分治，搜索，动归，数论等得内容，很有参考价值-Introduction courseware ACM algorithm, it is suitable for beginners, including enumeration, greedy, divide and conquer, search, dynamic return, so get the contents of number theory, a good reference
selector
- 多会场活动安排算法实现。利用嵌套贪心策略实现多会场、互斥活动最优安排问题。-Arrangements for multi-venue event algorithm. Greedy strategy using nested multi-venue, the best arrangement for mutually exclusive events.
alogrithms-in-pku
- 北京大学 算法分析与复杂性理论国家级精品课程课件，非常值得一看。分治，贪心，动态规划，NP理论-Peking University, algorithm analysis and complexity theory national quality courseware, very worth seeing. Divide and conquer, greedy, dynamic programming, NP theory. . .
PKU_ACM_Code
- 北大ACM的代码，很经典的源代码 主流算法：搜索，动态规划，贪心，图论，数论，计算几何，组合数学，模拟，数据结构，博弈论 -ACM code of Beijing University, is the source code of the mainstream of classical algorithms: search, dynamic programming, greedy, graph theory, number theory, computational geometry,
Prim
- 算法，写的prim算法，用的是贪心法，里面还有用到最小生成树来写的-Algorithm, written in the prim algorithm using a greedy method, there is also used to write the minimum spanning tree
tanxin
- 关于贪心和一些其他算法的讲义，全是PPT和word，内容蛮好的。-On greedy algorithms and some other handouts, all PPT and word, the content just fine.
comparision--of-two-algorithms
- 对动态规划法和贪心法的分析和比较,通过比较研究来分析各算法的特点。-Analysis and comparision with two algorithms