搜索资源列表
cpar
- 关联分类算法采用贪心算法发现高质量分类规则
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
各种排序算法
- 各种常用的排序算法源程序,包括快速排序/归并排序/带限期的排序以及贪心法的实现程序-various commonly used algorithm source, including rapid sequencing / merge sorting / ranking with the deadline and the greedy method to achieve procedures
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
贪心算法--会场安排
- ACM竞赛题目 公司面试题目 链表 循环 相交
贪心算法最优服务问题
- 设有n 个顾客同时等待一项服务。顾客i需要的服务时间为ti, 1≦i ≦n 。共有s处可以提供此服务。应如何安排n个顾客的服务次序才能使平均等待时间达到最小?平均等待时间是n 个顾客等待服务时间的总和除以n。
huichanganpai.rar
- 贪心算法，会场安排问题！希望对大家有帮助，谢谢！,Greedy algorithm, the venue arrangements! We want to help, thank you!
LectureHalls.rar
- acm算法设计—会场安排问题！ 假设要在足够多的会场里安排一批活动，并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。(这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点，不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数，相应于要找的最小会场数。) 对于给定的k个待安排的活动，编程计算使用最少会场的时间表。,acm algorithm design- the venue arrangements! Assume it to be enough room
greedyalgorithm.rar
- 利用贪心算法从而实现了任务调度问题的过程,Greedy algorithm- the task scheduling problem
horse-riding-board
- 马踏棋盘程序，使用c++编写，经典的贪心算法实现快速得出结果-Horse riding board, the use of c++ written in the classic outcome of the greedy algorithm for fast
suanfashiyanbaogao
- 算法设计实验报告 递归与分治 和贪心算法-Recursive algorithm design lab report and the greedy algorithm with sub-rule
Greed
- 利用贪心算法解决“部分背包问题”。这是个经典算法，实现的也比较完善，易用而且BUG少。-This code is about the "Knapsack problem".Our policy is the "Greedy Algorithm".It s easy to use & has nearly no BUG.
greedy_OBST
- 贪心算法实现的最优二叉查找树，c++代码实现，运行无误-Greedy algorithm of optimal binary search tree, c++ code to run correctly
huffman.rar
- 用优先队列实现霍夫曼编码，是对贪心算法实现的一个详细代码。输入文件是待编码文件，输出文件是各个字符编码信息。,Priority queue with the realization of Huffman code is a greedy algorithm to achieve a detailed code. Input file is to be encoded file, output file is all character encoding information.
jiayouwenti
- 用贪心算法实现加油问题的代码,而且是以C++实现的。-this is a C++!include<iostream.h> #include<fstream.h> ifstream infile("E:\\jiayou.in") ofstream outfile("E:\\jiaou.out") void jiayou(int*x,int n,int k){
TSP-MST.rar
- 最小生成树的思想应用于TSP问题的求解，贪心算法的实际应用。,Minimum Spanning Tree thinking applied to TSP problem solving, the practical application of greedy algorithm.
work9
- 假设要在足够多的会场里安排一批活动，并希望使用尽可能少的会场，设计一个有效的贪心算法进行安排。-Enough to assume that many of the arrangements for the venue where a number of activities and want to use the venue as small as possible, design an efficient greedy algorithm to carry out the arrangemen