搜索资源列表
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
basicAlgorithm(pascal)
- 基本算法正稿 包括:一、数论算法；二、图论算法；三、背包问题；四、排序算法；五、高精度计算；六、 树的遍历；七 进制转换；八 全排列与组合的生成；九.查找算法；十、贪心；十一、回溯法框架；十二、DFS框架；十三、BFS框架；十五、数据结构相关算法
knapsack
- 背包问题算法 - 贪心法，递归法和动态规划法分别解决-Three solutions to Knapsack problem: the integer knapsack problem solution, fractional knapsack solution and DDG solution
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.
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
strassen
- 本算法使用贪心算法的思想，使得一个整数去掉指定n个字符后，得到的整数最小-The algorithm uses the greedy algorithm makes a specified integer integer n characters removed, the resulting minimum
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
parking-charge
- 简易停车场收费系统，贪心算法，背包问题。简易界面-parking charge
huffman
- Huffman算法是一种用来构造最优前缀码（Huffman编码）的贪心算法,java实现-Huffman algorithm is a kind of used to construct the optimal prefix code greedy algorithm (Huffman coding), the Java implementation
merge-problem
- 贪心算法-最优合并问题 给定k 个排好序的序列s , s , , sk 1 2 , 用 2 路合并算法将这k 个序列合并成一个序列。 假设所采用的 2 路合并算法合并 2 个长度分别为m和n的序列需要m + n -1次比较。试设 计一个算法确定合并这个序列的最优合并顺序，使所需的总比较次数最少。-贪心算法-最优合并问题 给定k 个排好序的序列s , s , , sk 1 2 , 用 2 路合并算法将这k 个序列合并成一个序列。 假设所采用的
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