搜索资源列表
Graph
- 贪心算法 ;用到图结构,栈和队列来解决哈密顿回路;输出结果:路径(每条边及其权值),总和-Greedy algorithm use graph structure,stacks and queues to solve the Hamiltonian circuit output:path (each edge and the right value),the sum
Prim
- 用贪心算法,求解最短路径问题; 通过根据当前的最优情况,选择最好的节点;-greedy alogith ,in order to get the best result for the station of the matter
Best_add-oilrar
- 也是用贪心算法,来求解一个最优解,不过,它是根据当前的最好加油位置,来决定下一个加油位置;
3-2
- 堆排与贪心算法解usaco 1-3-2牛棚问题 -Heap row with the greedy algorithm for solving the problem usaco 1-3-2 barn1
main
- poj1328: Radar Installation。贪心算法。正确程序-poj1328: Radar Installation. Greedy algorithm. accepted program
main
- poj2109:Power of Cryptography.贪心算法.正确程序.-poj2109:Power of Cryptography.Greedy algorithm.accepted program.
greedy
- 问题描述: 假设要在足够多的会场里安排一批活动,并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。(这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点,不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数,相应于要找的最小会场数。) 编程任务: 对于给定的k个待安排的活动,编程计算使用最少会场的时间表。 数据输入: 由文件或键盘给出输入数据。第一行有1 个正整数k,表示有k个待安排的活动。接下来的k行中,每行有2个正整数
tanxinsuanfa
- 希望各位能够有帮助,比较简单的贪心算法,各位多多支持-Hope you will be helpful, relatively simple greedy algorithm, ladies and generous support of the
tanxinsuanfa
- 背包问题和0/1背包问题的主要区别就是物品可不可以再分割。背包问题中的物品可以再进行分割,而0/1背包问题中的物品则反之。贪心算法往往只从局部去考虑问题,所以在解决0/1背包问题时得不到最优解。-class GreedyAlgorithm{ public: GreedyAlgorithm(int _weight[],int _value[],int capacity) double*ComputeRatio() void Sor
H1
- 贪心算法解删数问题 运用C++ Delete a few greedy algorithm for solving the problem-Delete a few greedy algorithm for solving the problem
cupidity
- 使用visual c++语言编写的贪心算法-Using visual c++ language of the greedy algorithm
WithTheOrdinaryKnapsackProblemGreedyAlgorithmToSol
- 用贪心算法求解普通背包问题的代码 用贪心算法求解普通背包问题的代码-With the ordinary knapsack problem greedy algorithm to solve the code
GreedDelNum
- 删数问题源码,使用贪心算法 内有贪心规则说明-There are a few problems deletion greedy rule source descr iption
GreedySelector
- 图形界面的贪心算法,动态显示运行求解问题的过程-Graphical interface, greedy algorithms, dynamic display of running the process of problem solving
zhaolingqian
- 本人上传的是用贪心算法实现找零钱问题。贪婪算法的根本思想是逐步获得最优解。-I uploaded is to use greedy algorithm to find small change problem. Greedy algorithm is the fundamental idea is to gradually get the optimal solution.
greed
- 贪心算法,动态生成数组后,然后计算得到最小生成树-greed algorithm
31
- 为了方便大家学些,上传了一个贪心算法的算法-In order to facilitate everyone to learn more, upload the algorithm, a greedy algorithm
32
- 为了方便大家学习,上传了一个贪心算法的算法代码-In order to facilitate them to learn, upload a greedy algorithm algorithms code
yundongyuanzuijiapipei
- 计算机算法设计,用于设计贪心算法,你们懂得-Computer algorithms designed for the design of dynamic programming, you know
suanfasheji
- c++实现的汽车加油问题,内含具体代码,使用贪心算法实现-c++ implementation of the vehicle refueling, containing the specific code