搜索资源列表
changyong
- 动态规划分治算法概率算法模拟退火算法神经网络搜索算法贪婪算法网上matlab遗传算法组合算法Floyd算法-dynamic programming algorithm partition probability algorithm simulated annealing neural network algorithm for the greedy algorithm search online matl ab genetic algorithm combination algorithm Fl
whiteblackpoint
- 黑白点的匹配贪心算法 设平面上分布着n个白点和n个黑点，每个点用一对坐标（x, y）表示。一个黑点b=（xb,yb）支配一个白点w=(xw, yw)当且仅当xb>=xw和yb>=yw。若黑点b支配白点w，则黑点b和白点w可匹配（可形成一个匹配对）。在一个黑点最多只能与一个白点匹配，一个白点最多只能与一个黑点匹配的前提下，求n个白点和n个黑点的最大匹配对数。-black and white point matching greedy algorithm based on the d
OI
- 用多种算法解决0－1背包问题，包括回朔法，动态规划，贪心算法等-algorithm used to solve a variety of 0-1 knapsack problem, including the retrospective method, dynamic programming, greedy algorithm
greedy_tuopupaixu
- 介绍了贪婪算法在拓扑排序中的应用,对于学习贪婪算法很有用-of greed in topological sorting algorithm, the application learning greedy algorithm useful
coinproblem
- 经典的硬币问题：使用最少个数的硬币来达到指定的钱数。使用贪心算法。vc下调试通过-classic coin : the use of at least the number of coins to reach the specified amount of money. Use greedy algorithm. Vc under through debugging
MaxLoading
- 贪心算法解最大装载问题-greedy algorithm largest Loading Problem Solution
装载问题的算法
- 一个用贪心算法做的-with a greedy algorithm to do
abcd
- 贪婪算法解决背包问题-greedy algorithm to solve knapsack problem
活动安排问题
- 贪心算法实现活动安排问题-greedy algorithm activities arrangements
missileProblem
- acm防御导弹问题详细解答，所用方法为dp 和greedy algorithm，完整的解决了这个问题。
算法设计与分析 报告 一
- 贪心算法解最优装载问题-greedy algorithm for optimal solutions loading problem
最小生成树（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
单源点最短路径贪心算法
- 单源点最短路径贪心算法：用到Dijkstra算法，-single source shortest path greedy algorithm : use Dijkstra algorithm,
跳马
- 贪婪算法实现的马的遍历,简单易懂,可以看看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
贪心法
- 用贪心法解决TSP问题.输入数据可求得所要的最值的结果.-greedy algorithm used to solve TSP. Input data can be obtained by the most value to the results.
马踏棋盘-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.
贪心算法
- 模式识别中的贪心算法，是根据分配篮球队员的简单条件做的-pattern recognition of greedy algorithm is based on the distribution of basketball players do the simple conditions