搜索资源列表
huichang
- 对贪心算法的应用，会场安排问题，会场开始和结束的时间在输入文件输入，所需的至少会场个数在输出文件输出-Greedy algorithm for the application of the venue arrangements, the venue of the beginning and end of time in the input file input, the venue for at least the required number in the output file outpu
0-1
- 0-1背包问题的贪心算法 希望对大家有帮助-0-1 knapsack problem the greedy algorithm would like to help everyone
4-7you
- 计算机算法的多处最优服务次序问题，用贪心算法实现-Computer algorithm of multiple optimal service order issues, with greedy algorithm
beibao
- 通过贪心算法实现背包问题，可实现小规模背包问题-Through the greedy algorithm knapsack problem, enabling small-scale knapsack problem
yuhen
- 用贪心算法解题: 设n是一个正整数。现在要求将n分解为若干互不相同的自然数的和，且使这些自然数 的乘积最大。-Greedy algorithm with problem-solving: Let n be a positive integer. N decomposition will now require a number of separate and natural number, and make them the product of the largest natural nu
tanxinsuanfa
- 本文章介绍了贪心算法的过程及运用C语言的实现-This article describes the process of greedy algorithm and the realization of the use of C language
suanfashejiyufenxi
- 计算机算法设计与分析实验报告:6大算法详细实验报告(相当详细).分治,动态规划,贪心,回溯,分支限界-Computer Algorithm Design and Analysis of Experimental Report: 6 large algorithm experiment detailed report (in considerable detail). Sub-rule, dynamic programming, greedy, backtracking, branch and b
zuixiaoshengchengshu
- 使用贪心算法编程，求解最小生成树问题,并给出详细的过程！-The use of greedy algorithm programming, minimum spanning tree problem solving, and gives details of the process!
Program
- 用很简单的方法描述了如何勇贪婪算法解决旅行商问题-Using very simple methods Yong describes how greedy algorithm to solve traveling salesman problem
Prim
- 这是一个构造最小生成树的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
beibao
- 程序中的beibao1函数采用了贪婪算法的另一种写法，beibao函数是以前的代码，用来比较两种算法-Process beibao1 function greedy algorithm used another wording, beibao function is the previous code, used to compare two algorithms
026634-01
- 算法的课件文件，关于贪心算法解决汽车加油次数最少问题 -Algorithm courseware documents, on the greedy algorithm to solve the least number of motor vehicle refueling problem
client
- 使用贪心算法解决最优服务次序问题，效率高，适用于ACM竞赛-Use greedy algorithm to solve the optimal order of service, high efficiency, apply to ACM Contest
greedy
- 贪心法的算法，里面有最小生成树算法和单点源最短路径的算法，供大家学习参考-Greedy algorithms, there are minimum spanning tree algorithm and single-point-source shortest path algorithm, for them to learn from reference
tanxin
- 本PPT为算法设计中的贪心算法，对需要的朋友可以用来参考一下。-The PPT algorithm design for the greedy algorithm, in need of a friend can be used to refer to.
Queen
- 算法设计与分析中，对N皇后进行编程，主要运用到的是贪心算法。-Algorithm design and analysis, on the N s programming, the main use of the greedy algorithm.
GreedyAlgorithm
- 贪心算法Greedy Algorithm-Greedy algorithm Greedy Algorithm
ProblemF
- 算法分析与设计中的汽车加油问题，用贪心算法来进行 -Algorithm analysis and design of the automobile refueling problem, greedy algorithm used to carry out
dating
- 用贪心算法做的一道ckp的约会 期间用快速排序对约会结束时间做了升序排列 跟活动安排异曲同工-Greedy algorithm used to do together during appointments ckp quick sort of dating the end of time to do the activities arranged in ascending order with the same
ShortEst
- matlab最短路的贪心算法，用VC++实现，把ShortEst.dll复制到matlab工作文件夹运行（先要运行mex-setup，关联VC与MATLAB）调用方法如 a = [-1,2,3 2,-1,4 3,4,-1] ShorstEst(a) 即可-matlab most short-circuit the greedy algorithm, using VC++ to achieve, and copy it to ShortEst.dll working folder m