搜索资源列表
tanxinsuanfa
- matlap 仿真源代码,利用贪心算法实现认知无线电的频谱分配。-matlap simulation source code, the use of greedy algorithm of cognitive radio spectrum allocation.
Prim101
- 这是一个构造最小生成树的Prim算法,是属于贪心算法的范畴。设G=(V,E)是连同带权图,V={1,2,3,...,n}。构造G的最小生成树。-This is a structure of Prim minimum spanning tree algorithm is a greedy algorithm category. Set G = (V, E) is, together with the weighted graph, V = (1,2,3 ,..., n). G of the min
tanxin_beibao
- 以背包问题为例,介绍贪心算法解决得到一个最优值-Knapsack problem as an example to introduce a greedy algorithm to solve the optimal value