搜索资源列表
贪心算法背包问题
- 这个小程序,是我作为C#初学者的省份写出来,主要是练手的。主要是在算中的一种思想。环境VS2010,传于2010-10-31,地点安徽马鞍山某高校
贪心遗传算法求解背包问题
- 把贪心算法和遗传算法相结合,从而得出对NP难题的背包问题进行优化求解。
背包问题的贪心算法
- 背包问题的贪心算法
MaxLoading
- 贪心算法解最大装载问题-greedy algorithm largest Loading Problem Solution
Kruskal算法:(贪心)
- Kruskal算法:(贪心)-Kruskal algorithm : (greedy)
装载问题的算法
- 一个用贪心算法做的-with a greedy algorithm to do
活动安排问题
- 贪心算法实现活动安排问题-greedy algorithm activities arrangements
算法设计与分析 报告 一
- 贪心算法解最优装载问题-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
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
XR_AI_Project2_v1
- 用人工智能方法编写的五子棋程序,使用了贪心算法等,运行速度很快,人工智能比较强大-using artificial intelligence methods to prepare the 331 procedures, the use of the greedy algorithm, running very fast, more powerful artificial intelligence
Huffman树
- 用加权二叉树,最小堆和贪心算法实现的Huffman树,对学算法和数据结构的朋友很有帮助-weighted binary tree, the smallest reactors and the greedy algorithm Huffman tree for school algorithm and data structure of helpful friends
会议安排
- 本代码用贪心算法实现会议安排的最佳顺序,其目标是使得能够安排的会议数量最多,是贪心算法的典型应用-code with the greedy algorithm to achieve the best arrangements for the order, its goal is to arrange the largest number of meetings, the greedy algorithm is a typical app
tanxin
- 这是一个贪心算法的c程序。贪心算法(也叫贪婪算法)不是某种特定的算法,而是一类抽象的算法,或者说只是一种思想,它的具体表现在,对解空间进行搜索时,不是机械地搜索,而是对局部进行择优选取,贪心算法的目的不是为了找到全部解,也当然找不出最优解,而只是找出一种可行解,这样就会得到惊人的高效性。因此,贪心算法也叫启发式搜索,这种启发就是所谓的“贪心策略”。-This is a greedy algorithm c procedures. Gre
Graph3
- 最小生成树的贪心算法实现 普里姆算法 用邻接矩阵进行图的生成-the minimum spanning tree algorithm Primbetov greedy algorithm adjacent matrix chart generation
贪心方法
- 贪心方法解0/1背包问题,构造一个物品类,调用类方法对背包进行排序,核心代码已给出-greedy method for 0/1 knapsack problem, a structural categories of goods, the category called right backpack method for sequencing, the core code has been given
short_path
- 图遍历找两点最短路径的多中方法:贪心 回朔 分支界限-map traverse the shortest path to find two more of the methods : greed back Schomburg branch Limits
caitou
- 贪心算法解决分割问题 给定一定的宽度,和N个输入(宽度) 得出最小的宽度-greedy algorithm to solve the segmentation problem must set the width and N input (width) reached the minimum width
MaxSubMin
- 用贪心算法编写的有关最大级差问题的java程序-greedy algorithm used in the preparation of the largest differential in java programs