搜索资源列表
贪婪算法作业
- 一个关于使用贪婪算法的程序，是我同学在外国上课的一个作业，对学校贪婪算法有一定的帮助，详细的题目和注释在里面-a greedy algorithm on the use of the procedure is that I students in a class of foreign operations, the greedy algorithm schools will help, and the subject of detailed notes inside
背包问题之贪婪算法求解C语言源代码)
- 背包问题的贪婪算法，需要的下，不需要帐号的，自由的下。-knapsack problem of greedy algorithm, need, need not account, free under.
GreedyTP
- 同学做的基于贪婪策略的拓扑排序算法可视化演示程序，支持用户自己画出拓扑图，VC++.net下测试通过。-students so greedy strategy based on the topological sorting algorithm visualization demo program that allows users to draw their own topology map, VC. Net under test.
ArithmeticDesignMethod
- 此文章的算法有迭代法、穷举搜索法、递推法、贪婪法、回溯法、分治法、动态规划法等等，有用的的人可以
GLJ
- 用贪婪算法寻找交换机的最佳匹配端口，效率比较高，时延抖动也比较小
ana
- 蚁群算法是一种求解组合最优化问题的新型通用启发式方法，该方法具有正反馈、分布式计算和富于建设性的贪婪启发式搜索的特点。通过建立适当的数学模型，基于故障过电流的配电网故障定位变为一种非线性全局寻优问题
abcd
- 贪婪算法解决背包问题-greedy algorithm to solve knapsack problem
Gewsh_HorseWalksCheckerBoard
- 使用贪婪算法解决的马踏棋盘的问题（使用简单排序和深度优先搜索的方法）
tanlansuanfa
- 此文件为贪婪算法的matlab源代码,适合参加数学建模的同学使用
最小生成树（Kuskal算法）
- 该程序用贪心算法来求解最小生成树问题 采用贪婪准则：每次选择边权值最小边。如果该边加入后不构成环，则加入。-procedures with the greedy algorithm to solve the problem using the minimum spanning tree greedy guidelines : each side the right to choose the minimum value side. If the edge after the entry does
0-1背包问题
- 该程序用贪心算法来求解0-1背包问题 采用贪婪准则：每次选择p/w最大的物品放入背包。-procedures with the greedy algorithm to solve 0-1 knapsack problem using greed criteria : Each choice p / w largest goods Add backpack.
二分覆盖问题
- 该程序用贪心算法来求解二分覆盖问题. 采用贪婪准则：每次从A中选择一个顶点加入覆盖，选择时：选取能覆盖B中还未被覆盖的顶点的数目最多的顶点。-procedures with the greedy algorithm to solve two hours coverage. Using greed criteria : A time to choose from a peak accession coverage options : To B coverage can not be covered
跳马
- 贪婪算法实现的马的遍历,简单易懂,可以看看MFC类的派生和消息影射的一些咚咚,使用环境为VS。NET-greedy algorithm of the horse traversal, simple to understand and can look at the MFC category derived alluding to the news and some behind, the use of the environment VS.NET
马踏棋盘-vc.net
- 采用贪婪算法在VC.net环境下实现马踏棋盘。并提供多种路径-greedy algorithm used in VC.net environment under chessboard horse riding. And provide multiple paths
Class1
- 用贪婪算法中的哈夫曼编码为文件进行压缩，得到一个比较好的压缩程序．-greedy algorithm with the Huffman encoding of the document for compression, to be a relatively good compression process.
knap
- 用贪婪法的策论，用非递归实现背包问题的求解，并求出放如背包中的物品．-greedy law with political discourse, the use of non - recursive Knapsack Problem Solving and sought release if the items backpack.
suanfa
- 常用算法,为初学者服务,简单易懂,常用的算法设计方法： 数值算法：迭代法、递归法、插值法等； 非数值算法：分治法、贪婪法、回溯法等。-Commonly used algorithms, for beginners service, easy to understand, common algorithm design methods: numerical algorithms: iterative method, the recursive method, interpolation m
CommonAlgorithmDesign
- 常用的算法设计方法集合，主要有迭代法、穷举搜索法、递推法、贪婪法、回溯法、分治法、动态规划法-Algorithm commonly used method of collection, mainly iterative, exhaustive search methods, recursion, greedy method, backtracking, divide and conquer, dynamic programming
6-8
- 贪婪法解决背包问题（局部最优解） 输入项数和重量 输出需要使用的背包数(Greedy method for solving knapsack problem (local optimal solution))
CS
- 压缩感知常见的几种重建算法，主要是贪婪算法一类(the resconstruction algotithm of compressed sensing)