搜索资源列表
search_method
- 搜索算法——包含回溯法、分枝定界和贪心法
0-1
- 这是一个用C++实现的0/1背包问题，它是用贪心法实现的。
算法设计
- 算法设计有贪心法，回溯法，动态规划等 算法设计有贪心法，回溯法，动态规划等
Dijkstra
- Dijkstra 贪心法求单源最短路径.Dijkstra算法是解单源最短路径问题的一个贪心算法。
suanfabaogao
- 算法设计与分析试验报告，含全部实验源代码，包括贪心法、回溯法、深度优先搜索、分治法等，内容详尽。
tanxin
- 背包问题 贪心法C++实现 功能健康，绝对无毒
DIJKSTR
- 用贪心法解单源最短路径,比较不错的一个算法,大家好好看下
suanfafenxiyusheji
- 算法分析与设计课程设计基于贪心法的装箱问题设计报告
tanxinxiang
- 算法分析与设计课程设计基于贪心法的装箱问题设计报告
各种排序算法
- 各种常用的排序算法源程序,包括快速排序/归并排序/带限期的排序以及贪心法的实现程序-various commonly used algorithm source, including rapid sequencing / merge sorting / ranking with the deadline and the greedy method to achieve procedures
tanxinfa
- 算法设计与分析中的贪心法源程序，用VC编写，应用贪心设计策略来解决操作系统中单机、无资源约束且每个作业可在等量时间内完成的作业调度问题-algorithm design and analysis of the greedy algorithm source, VC preparation, application greedy design strategies to solve the stand-alone operating system, without resource constra
背包问题2 递归
- 一个0-1背包问题的C++实现，背包的容量为t，各物品的重量分别为w1，w2。。。wn，找一个能装下最大重量的物品组合，用递归形式的贪心法实现-a 0-1 knapsack problem of C achieved, the capacity for backpack t, the weight of the items were w1, w2. . . Wn, one can find the largest installed under the weight of goods portf
Greedy_Implicit-贪心算法_隐枚举法
- 贪心算法_隐枚举法（0 - 1 整数规划求解）,matlab代码-Greedy algorithm _ implicit enumeration method ( 0- 1 integer programming solver ) ,matlab code
knapsack
- 0—1背包问题的五种解法 1贪心法 2动态规划 3回溯 4分支限界 5遗传算法-0-1 knapsack problem greedy algorithm five Solution 1 2 3 back in 4 dynamic programming genetic algorithm branch and bound 5
duo
- 名称叫做多边形游戏,是算法设计技巧与分析中经常会遇到的一类问题,主要是由贪心法来解决-Name of the game called the polygon is algorithm design techniques and analysis of a class of frequently encountered problems, mainly by the greedy method to solve
01package
- 01背包问题的贪心法源代码 供给有需要的参考-01 knapsack problem greedy algorithm source code
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,
27796737GREEDYSELECT1
- 贪心法会议安排，先对结束时间排序，然后依次取出最大子集。-Greedy schedule of meetings, the first sort of the end of time, to be followed by the largest subset removed.
37724128sche3
- 贪心法会议安排，先安结束时间排序，然后依次取出最大子集。-Greedy schedule of meetings before an end time to sort, to be followed by the largest subset removed.
greedy
- 贪心法的算法，里面有最小生成树算法和单点源最短路径的算法，供大家学习参考-Greedy algorithms, there are minimum spanning tree algorithm and single-point-source shortest path algorithm, for them to learn from reference