搜索资源列表
Activearr
- 用贪心算法编写的有关活动安排问题的java程序-greedy algorithm used to prepare the arrangements for the activities of java programs
beibaotanxinsuanfa
- 贪心算法,使用这一算法,解决0-1背包问题.-greedy algorithm, the algorithm used to solve 0-1 knapsack problem.
javaTANXINFABEIBAO
- 用JAVA编写的关于算法分析与设计里的如何用JAVA实现关于贪心法的背包问题,简单明了.有很强的实例意义.-with JAVA prepared by the analysis of the algorithm and the designing of how to use JAVA of greedy law backpack , simple and clear. a strong example of significance.
tx
- 两个贪心实例，学算法时编的，比较简单，但有代表性-two greedy example, learning algorithm series, relatively simple, but a representative
Kruskal算法：(贪心)
- Kruskal算法：(贪心)-Kruskal algorithm : (greedy)
Knightcruise
- 骑士漫游，马跳棋盘可视化效果，很有趣，且使用贪心算法非常便捷，速度很快
basicAlgorithm(pascal)
- 基本算法正稿 包括:一、数论算法；二、图论算法；三、背包问题；四、排序算法；五、高精度计算；六、 树的遍历；七 进制转换；八 全排列与组合的生成；九.查找算法；十、贪心；十一、回溯法框架；十二、DFS框架；十三、BFS框架；十五、数据结构相关算法
beibao
- 该可实现简单的背包功能，可用最佳贪心算法和最佳路径算法，可获得。
package
- 此小程序用java实现了可以分割的背包问题，开发平台是Eclipse。其中主要是用贪心算法实现背包问题，在将物品进行排序时，没有使用经典的merge-sort算法，而是直接使用了java中Arrays类的sort的方法，但要自己定义类，实现接口Comparator。
用贪心算法解决旅行商问题
- 用贪心算法解决旅行商问题，能运行的，是本科四年级的软件课程设计源码！,Use greedy algorithm to solve traveling salesman problem, will be able to run is the fourth year undergraduate curriculum design of the software source code!
Othello
- JCreator下开发，黑白棋游戏，可以实现人机对战和人人对战，采用贪心算法因此棋力不佳，整个程序的框架不错，有兴趣可以在此基础上改善AI算法提高棋力-JCreator under development, Reversi games, can be achieved and everyone against the war machine, the use of greedy algorithm棋力poor, therefore, the framework of the entire pro
tanxin
- 经典的背包问题用贪心法实现的JAVA代码-Classical knapsack problem greedy method using the JAVA code
knapsack
- 背包问题算法 - 贪心法，递归法和动态规划法分别解决-Three solutions to Knapsack problem: the integer knapsack problem solution, fractional knapsack solution and DDG solution
greedyselector
- 算法：贪心算法 进行活动安排。 JAVA语言实现-Greedy method to achieve activity arrangements. JAVA language
Arithmetic
- 用JAVA完成的0-1背包算法，一共用了四种算法，包括贪心，分治，动态规划，回溯。把工程导入ECLIPSE下就可以了。-JAVA finished 0-1 with a knapsack algorithm, a share of the four algorithms, including greedy, divide and conquer, dynamic programming, backtracking. To work on it under into ECLIPSE.
shanshu
- 利用贪心算法，将一个正数删除规定位数，得到一个最小值-Use of greedy algorithm, to delete the provisions of a positive digit, to get a minimum
DeleteNumber
- 贪心算法实现删数功能，本程序在Eclipse 环境下运行成功 -delete number use of greedy algorithm .this program can do it in Eclipse envoirnment.
Huffman
- 贪心算法实现哈夫曼编码，算法作业可以参考-Greedy algorithm Huffman algorithm
DuoChuZuiYouFuWuCiXu
- 贪心算法实现多次最优服务次序问题，算法作业可以参考一下-Greedy algorithm many times the optimal order of service
GreedyAlgorithms
- 贪心法实现背包问题，运用枚举法实现，根据结果分析该算法的贪心性质-The greedy method knapsack problem, using the enumeration method to achieve, based on the results of analysis of the greedy nature of the algorithm