搜索资源列表
算法设计与分析实验
- 哈夫曼编码。排序问题，利用贪心算法的思想实现哈夫曼编码算法程序 -Huffman coding. Scheduling problems, the greedy algorithm achieving Huffman coding algorithm
装载问题的算法
- 一个用贪心算法做的-with a greedy algorithm to do
算法设计与分析 报告 一
- 贪心算法解最优装载问题-greedy algorithm for optimal solutions loading problem
最小生成树（Kuskal算法）
- 该程序用贪心算法来求解最小生成树问题 采用贪婪准则：每次选择边权值最小边。如果该边加入后不构成环，则加入。-procedures with the greedy algorithm to solve the problem using the minimum spanning tree greedy guidelines : each side the right to choose the minimum value side. If the edge after the entry does
greedyjs
- 贪心算法之带有限期的作业排序。应用贪心设计策略解决操作系统中单机、无资源约束且每个作业可以在等量的时间内完成的作业调度问题。-Greedy Algorithm for Scheduling with deadline. Application greedy single operating system design strategy to solve, no resource constraints and each job can be completed within the same a
suanfafenxi
- 算法分析课的实验-算法分析与设计\贪心算法-最优装载
thegreedyalgorithmusinggeneticalgorithmssolveknaps
- 详细的讲述了贪心算法和遗传算法相结合去求解NP难题，背包问题。-Greedy algorithm described in detail and the combination of genetic algorithms to solve the NP problem, knapsack problem.
TSPSA
- 贪心算法和退火模拟算法的MATLAB程序，贪心算法仅是在某种意义上的局部最优解。(Greedy algorithm MATLAB procedures, greedy algorithm is only in a sense of the local optimal solution.)
GREEDY MAX-IS
- 最大独立集的贪心算法简易实现，可以快速求取节点数量较少的最大独立集问题。(An approximated greedy algorithm for Maximum Independent Set Problem)
贪心算法
- 贪心算法的详细说明，哈哈哈哈哈哈哈哈哈哈哈(Greedy algorithm is described in detail)
贪心
- 贪心算法的应用：对地点运输的贪心算法实现(Application of greedy algorithm)
function
- 一些算法的集合，可以直接测试使用，包括动态划分，分治，贪心算法等(Some of the sets of algorithms can be used directly to test the use of)
源代码及数据
- 随着高校不断扩招，数字化校园的不断推进，应用信息化高效的分配和管理宿舍是非常有意义的。本作品创新性地引入了“种子选手”，并基于贪心算法设计出宿舍分配方案。用Python的GUI设计可视化界面，最终形成了宿舍分配系统。(With the continuous expansion of colleges and universities and the continuous promotion of digital campus, it is very meaningful to distribut
best
- 贪心算法解决最优装载问题，c++版本。已设置初始重量和容量。(A greedy algorithm to solve the optimal loading problem.C++ version. Initial weight and capacity have been set.)
背包问题
- 贪心算法解决背包问题：给定n种物品和一个背包。物品i的重量是Wi，其价值为Vi，背包的容量为C。应如何选择装入背包的物品，使得装入背包中物品的总价值最大?(The greedy algorithm solves the knapsack problem: a given n item and a backpack. The weight of the item I is Wi, its value is Vi, and the capacity of the knapsack is C. How
BE3
- 一个找零问题的不同实现方法。贪心算法，矩阵搜索等(The different implementation methods of a change problem. Greedy algorithm, matrix search, etc.)
贪心算法-局部背包
- 使用java语言实现贪心算法中的局部背包问题，适合正在学习这方面算法的人使用。(The Java language is used to implement the local knapsack problem in the greedy algorithm, which is suitable for people who are learning this algorithm.)
STL、贪心
- 在里面详细介绍了STL、贪心算法。并且包含一些具体的事例。(The STL and greedy algorithms are introduced in detail. And contains some specific examples.)
duoji
- 完成n个工作在m台机器上的贪心算法分配 每个作业只能选择一台设备加工，加工时间为t.每台机器一次只能加工一个作业，使等待时间最短。(Implementation of greedy algorithm allocation for n jobs on m machines)
贪心算法matlab程序
- 本代码详细介绍了贪心算法的应用，可以更好的了解出排序问题。