搜索资源列表
GreedyBag
- 贪心算法求背包问题,分别求出了三种标准1. 按效益值由大到小取物品. 2. 按重量值由小到大取物品 3.按比值pi/wi的值由大到小取物品 其中第3种是最优解-Greedy algorithm for knapsack problem, respectively, obtained three standard 1. Press-effective value of descending and remove things. 2. By weight the value of items
greedyprogram
- 关于员工任务分配问题的算法,我们用贪心算法来实现。这里是贪心算法的C语言程序。-using greedy to answer work problem
The_Greedy_Heuristic
- 表上作业法(贪心法)的MATLAB程序 解决运输问题的算法,内部有程序代码的详细介绍以及一个算例的介绍。本人为MATLAB初学者,欢迎交流,QQ420797419-This simple heuristic usually gives good, but possibly suboptimal solutions for the transportation problem.
text_1
- 会场排序 使用尽可能少得会场 安排所有会议 使用贪心算法 C语言实现-The sorting use as the less arrange all meetings, a greedy algorithm is used to realize the C language
setcover
- 贪心算法实现集合覆盖问题,不带权的集合覆盖问题,c++源码-Greedy algorithm set cover problem
Keyframe
- 从视频中提取关键帧,采用贪心算法和堆排序来处理视频中的大量帧信息。-Extracted from the video key frame, the use of greedy algorithm and HEAPSORT to deal with a large number of frames of video information.
CiPanZuiYouCunChu
- 贪心算法实现磁盘最优存储问题,java实现,算法作业参考-Greedy algorithm to achieve optimal disk storage problem
Dijkstra
- Dijkstra算法设计单源最短路径问题的贪心算法-Greedy algorithm of Dijkstra algorithm design single source shortest path problem
analysys-and-design-of-algorithm-ppt
- 我上课用的计算机算法设计与分析的电子教案,内容包括了最基本的分治法,贪心法,动态规划法,-I class computer algorithms used in design and analysis of electronic lesson plans, including the most basic sub-rule law, greedy method, dynamic programming method,
snake_VC++_win32
- 图像分割常用的主动轮廓模型中的一个经典算法——贪心算法的win32源码,使用VC++实现-Image segmentation of the active contour model commonly used in a classic algorithms- greedy algorithm win32 source, use VC++ Achieve
C
- 本文档容括了C(C++)所有算法,分为数值算法、图论算法、背包算法、排序算法、高精度算法、树的遍历、进制转换、全排列和组合生成、查找算法、贪心、回溯法框架、DFS框架、BFS框架、数据结构相关算法。并有实例源码-This document, including the capacity C (C ) for all algorithms, divided into numerical algorithms, graph theory, algorithm, knapsack algorit
dijkstra_suanfa
- dijkstra 这是用C语言实现的贪心算法 看这个程序前最好先看看图形说明-Dijkstra this is achieved using C language greedy algorithm to see this process take a look at the graphics before the best descr iption
tanxin
- 算法分析中的贪心算法,希望对学习的同学有所帮助。-Algorithm Analysis of greedy algorithm, and they hope to help students learn.
3
- 多元哈夫曼算法,用贪心算法求解石子合并的最优解-Multi-Huffman algorithm, greedy algorithm with the optimal solution of the stones combined
00
- 假设要在足够多的会场里安排一批活动,并希望使用尽可能少的会场。设计一个有效的贪心算法来进行安排。试编程实现对于给定的k个待安排活动,计算使用的最少会场。输入数据中,第一行是k的值,接下来的k行中,每行有2个正整数,分别表示k个待安排活动的开始时间和结束时间,时间以0点开始的分钟计。输出为最少的会场数。-Assume it to be enough room in the arrangements in a number of activities and want to use the venu
01pack
- 01背包问题,计算机算法中使用贪心算法与贪心策略的实现-01 knapsack problem, the computer algorithm with the greedy algorithm using the greedy strategy to achieve
tanxinsuanfa
- 这是一个用C语言编写的贪心算法程序,很好的模拟了这个算法。-This is a use of C language procedures greedy algorithm, a good simulation of the algorithm.
huichang
- 对贪心算法的应用,会场安排问题,会场开始和结束的时间在输入文件输入,所需的至少会场个数在输出文件输出-Greedy algorithm for the application of the venue arrangements, the venue of the beginning and end of time in the input file input, the venue for at least the required number in the output file outpu
0-1
- 0-1背包问题的贪心算法 希望对大家有帮助-0-1 knapsack problem the greedy algorithm would like to help everyone