搜索资源列表
arrange-meetting-room
- 贪心法 会场安排问题 非常实用 初学者必看的-Greedy method is very useful for beginners venue arrangements must-see
tanxin
- 背包问题是一种NP完全问题，使用贪心法优化解决背包问题。-Knapsack problem is an NP-complete problem, use the greedy algorithm optimization to solve knapsack problem.
exp3
- 贪心法解背包问题的c语言源程序 编译通过-Greedy method solving knapsack problem
The-shortest-path
- 用贪心法和动态规划两种算法求解有向图任意两个节点之间的最短路径，要求给出最短路径的值以及中间路径。-Greedy method and dynamic programming algorithm to solve the two have to figure the shortest path between any two nodes, required to give the value of the shortest path and the middle path.
greedy
- 贪心法解决背包问题 可自己设置物品数量和背包总容量-Greedy method to solve the knapsack problem and the number of items can set up their own backpack with a total capacity
shortest-route-problem
- 最短路径问题的四种实现方式:广度优先、深度优先、贪心法、动态规划法、穷举法、回溯法。-Four ways to achieve the shortest path problem breadth priority greedy depth-first dynamic programming method exhaustive backtracking
Knapsack
- 用贪心法求解背包问题。 构造方法，求解背包问题。参数kweight指定背包重量，数组arts提供若干物品-Knapsack problem using greedy method.
1
- 利用dijkstra贪心法获取由结点1到其余结点最短路径长度，输出保存到外部文件中-Get the rest node 1 to node shortest path length, save the output to an external file dijkstra-output1.txt use dijkstra greedy method
MaxLoading
- 最大装载问题，，采用贪心法实现，希望对大家有所帮助-The maximum loading problem ,, using greedy method to achieve, we hope to help
OptimalizingLoading
- 最优装载问题，采用贪心法实现，希望对大家有所帮助-Optimal loading problem, using the greedy method to achieve, we hope to help
zuixiaoshengchengshu-
- 本实例主要是利用贪心法来求解最小生成树的生成-In this case, we use the greedy method to solve the minimum spanning tree.
shortest-road
- 本实例主要是利用贪心法来求解单源点最短路径的判断-This example is the use of the greedy method to solve the single source point of the shortest path of the judge
progamming
- 各种算法比如矩阵鞍点，分划，n阶乘，螺旋阵，穿越沙漠，二分法求解方程，百鸡问题，残缺棋盘，贪心法删数，矩阵乘法动态规划。。。等等，亲测可以运行。-Various algorithms such as matrix saddle point, partition, n factorial, spiral array, through the desert, the dichotomy solve the equations, one hundred chicken issue, incomplet
Line-up-for-water
- 经典的贪心法问题——排队打水问题，这对研究数据结构的人来说是打好基础的好东西-The classic problem greedy method- queue to fetch water problem, which those who study the data structure is to lay the foundation of a good thing
salesman
- 售货员问题，用贪心法解决问题，虽然比较简单还算可以实现基本要求-salespersons questions, greedy algorithm to solve the problem, although it is relatively simple to achieve fairly basic requirements
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
lvxing
- 旅行商问题是NP完全的组合优化问题。分析了邻域启发式算法的基本操作,提出 一种简单的启发式贪心法,仅利用城市间的距离信息求解旅行商问题-Traveling salesman problem is np-complete combinatorial optimization problem.The basic operation of neighborhood heuristic algorithm is analyzed and presented A simple heuristic
Work-assignment
- 7人分配7项工作，利用穷举和贪心法，找出最好的分配方法-7 7 people assigned work, the use of exhaustive and greedy to find the best distribution method
tsp
- 利用贪心法编程实现TSP问题的最近邻点策略- U52A8 u6001 u89C4 u5212 u6C42 u89E3tsp
dros
- acm换钱的算法,主要检查货币的度量衡是否可以用贪心法()