搜索资源列表
贪婪算法作业
- 一个关于使用贪婪算法的程序，是我同学在外国上课的一个作业，对学校贪婪算法有一定的帮助，详细的题目和注释在里面-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.
GLJ
- 用贪婪算法寻找交换机的最佳匹配端口，效率比较高，时延抖动也比较小
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
跳马
- 贪婪算法实现的马的遍历,简单易懂,可以看看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.
boat
- 贪婪算法实现，船转载货物问题。基于C-Greedy algorithm, ship goods reprint.
suanfa
- 常用算法,为初学者服务,简单易懂,常用的算法设计方法： 数值算法：迭代法、递归法、插值法等； 非数值算法：分治法、贪婪法、回溯法等。-Commonly used algorithms, for beginners service, easy to understand, common algorithm design methods: numerical algorithms: iterative method, the recursive method, interpolation m
tanxin
- 背包问题的贪婪算法，主要是通过性价比来决定物品的选择。-The greedy algorithm knapsack problem, mainly through cost-effective to determine the choice of items.
c
- 本代码解决的是背包问题之贪婪算法。采用的是C语言源代码-This code is to solve the knapsack problem of the greedy algorithm. Using the C language source code
CommonAlgorithmDesign
- 常用的算法设计方法集合，主要有迭代法、穷举搜索法、递推法、贪婪法、回溯法、分治法、动态规划法-Algorithm commonly used method of collection, mainly iterative, exhaustive search methods, recursion, greedy method, backtracking, divide and conquer, dynamic programming
The-Horse-On-Board-And-PPT
- 自行解出的非网络上流行的贪婪算法，非递归算法，有ppt详解-Solve their own network of popular non-greedy algorithm, non-recursive algorithm, a ppt Detailed
backpack-prob-algo-using-in-C
- 不过下面程序中的背包函数采用了贪婪算法的另一种写法（背包函数是以前的代码，用来比较两种算法）-backpack problem algorithm using Greedy in C
贪心算法
- 贪心算法（又称贪婪算法）是指，在对问题求解时，总是做出在当前看来是最好的选择。也就是说，不从整体最优上加以考虑，他所做出的是在某种意义上的局部最优解。(The greedy algorithm (called greedy algorithm) refers to, in problem solving, always seems to be made in the best choice. That is to say, do not be optimal from an overall co
CS
- 压缩感知常见的几种重建算法，主要是贪婪算法一类(the resconstruction algotithm of compressed sensing)
贪心算法
- 贪心算法（又称贪婪算法）是指，在对问题求解时，总是做出在当前看来是最好的选择。也就是说，不从整体最优上加以考虑，他所做出的是在某种意义上的局部最优解。(Greedy algorithm (also called greedy algorithm) means that when solving a problem, it always makes the best choice at present. That is to say, not considering the overall opt