搜索资源列表
贪心法
- 用贪心法解决TSP问题.输入数据可求得所要的最值的结果.-greedy algorithm used to solve TSP. Input data can be obtained by the most value to the results.
knapsack
- 0—1背包问题的五种解法 1贪心法 2动态规划 3回溯 4分支限界 5遗传算法-0-1 knapsack problem greedy algorithm five Solution 1 2 3 back in 4 dynamic programming genetic algorithm branch and bound 5
TSP
- 用遗传算法、贪心算法以及穷举法对TSP问题进行求解-Genetic algorithm, the greedy algorithm and the brute-force method to solve the TSP problem
shortest-route-problem
- 最短路径问题的四种实现方式:广度优先、深度优先、贪心法、动态规划法、穷举法、回溯法。-Four ways to achieve the shortest path problem breadth priority greedy depth-first dynamic programming method exhaustive backtracking
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
gejeralbalancetzsgger
- 用多种算法解决0－1背包问题,包括回朔法,动态规划,贪心算法等()
xashrecordset
- 用多种算法解决0－1背包问题,包括回朔法,动态规划,贪心算法等()