搜索资源列表
xinchengxu
- 包括GRAY码，工作分配问题，会场安排，石子，行数字三角形，最长递增子序列和最小重量机器算法。利用动态规划、回溯法和贪心法-including GRAY code, work assignment, venue arrangements, gravel, and digital triangle, the longest sequences and increase the minimum weight machine algorithm. Using dynamic programming,
salesman
- 售货员问题，用贪心法解决问题，虽然比较简单还算可以实现基本要求-salespersons questions, greedy algorithm to solve the problem, although it is relatively simple to achieve fairly basic requirements
bowuguan
- 对大型活动的安排，贪心法，先对结束时间排序在依次取出最大子集。-Arrangements of large-scale activities, greedy method, first the end of time in order to sort out the biggest subset.
27796737GREEDYSELECT1
- 贪心法会议安排，先对结束时间排序，然后依次取出最大子集。-Greedy schedule of meetings, the first sort of the end of time, to be followed by the largest subset removed.
37724128sche3
- 贪心法会议安排，先安结束时间排序，然后依次取出最大子集。-Greedy schedule of meetings before an end time to sort, to be followed by the largest subset removed.
StoneGame
- 编程习题石子游戏的代码，贪心法实现，c-Pebble game code, greedy method, c++
Kruskal
- 贪心法是解决某些优化问题的一种策略。假设我们可以通过一系列的决策来解决某个问题。贪心法使用如下的方法：在每个阶段做出的决策都是局部最优的决策。对于某些问题，这些局部最优解最终成为全局最优解。-Generation of minimum spanning tree algorithm Kruskal
59b97a0f9cd260b6704714809da8ed39
- 旅行商问题是一个经典的问题，此代码用三种方法（枚举法，回溯法，贪心法），并可以对这三种方法进行比较-Traveling salesman problem is a classic problem, this code in three ways (enumeration method, backtracking, greedy method), and can be compared to the three methods