搜索资源列表
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.
用贪心算法解决旅行商问题
- 用贪心算法解决旅行商问题，能运行的，是本科四年级的软件课程设计源码！,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
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.
Kruskal
- Kruskal s algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in
Huffman
- 贪心算法实现哈夫曼编码，算法作业可以参考-Greedy algorithm Huffman algorithm
DuoChuZuiYouFuWuCiXu
- 贪心算法实现多次最优服务次序问题，算法作业可以参考一下-Greedy algorithm many times the optimal order of service
GreedySelector
- 这是本人近期研究的贪心算法，用来解决活动安排问题，算法数据从文件读入，可以在eclipse中运行，希望对大家有所帮助-This is my recent study of greedy algorithm used to solve the activity arrangements algorithms read data from the file, you can run in eclipse, we want to help
Greedy-algorithm
- 贪心算法 单元最短路径问题 最小生成树问题 多机调度问题-The minimum spanning tree of the the greedy algorithm unit shortest path problem of multi-machine scheduling problem
BestServiceList
- 最优装载问题的java实现，利用贪心算法实现-Java achieve optimal loading problems, the use of greedy algorithm
strassen
- 本算法使用贪心算法的思想，使得一个整数去掉指定n个字符后，得到的整数最小-The algorithm uses the greedy algorithm makes a specified integer integer n characters removed, the resulting minimum
01beibao
- 01背包的完整版，采用动态规划和贪婪算法解决-01 backpack full version, using dynamic programming and greedy algorithm to solve
PSOLSp
- 10个粒子群算法的旅行商问题，内容详尽 ，可以此类推n个城市的算法-greedy algorithm to do with the country s 31 cities between the TSP source code, the executable in Annex compressed packet. Inside data.txt city.txt of data tables and urban name, and the executable on the same withi
tanxinsuanfa
- 这是贪心算法用于数据仓库中物化视图的算法-This is a greedy algorithm algorithm for data warehouse materialized views
java_hanno
- java_hanno,java汉诺贪心九宫格算法集合,介绍各种经典算法，包含源代码-java_hanno, java Hanno squared greedy algorithm set to introduce a variety of classic algorithms, including source code
runner
- 本源码实现经典的守望者逃离问题，采用的算法为贪心算法，通过分析mp的量与总路程的关系，尽量选择闪现。-This source implementation of the classic watchers escape problems, using the algorithm for the greedy algorithm, through the analysis of the amount of mp and total distance relationship, try to choo
huffman
- Huffman算法是一种用来构造最优前缀码（Huffman编码）的贪心算法,java实现-Huffman algorithm is a kind of used to construct the optimal prefix code greedy algorithm (Huffman coding), the Java implementation
Machine-Scheduling
- 掌握贪心算法，利用贪心算法解决多机调度问题， 分析实验结果，是否能将机器处理时间最短化-Master greedy algorithm using the greedy algorithm to solve multi-machine scheduling problem, Analysis of experimental results, whether the machine can process the shortest of