搜索资源列表
shortest_path_adjacencyWDigraph
- 采用动态规划法，构建邻接矩阵带权有向图，解决最短路径问题。-Dynamic programming method used to construct adjacency matrix weighted directed graph, the shortest path to solve the problem.
dongtaiguihuafa
- 用于计算发电竞价的第三种算法：发电竞价算法_三_动态规划法-Used to calculate the third generation auction algorithm: generation bidding algorithms dynamic programming _ 3 _
oneTSP
- TSP问题的动态规划法 某售货员要到若干城市去推销商品，已知各城市之间的路程(或旅费)。他要选定一条从驻地出发，经过每个城市一次，最后回到驻地的路线，使总的路程(或总旅费)最小。-TSP problem of dynamic programming to a number of cities to a salesman to sell goods, known distance between cities (or travel). He selected a departure from th
CPP01beibao
- 使用动态规划法求解01背包问题，语言背景是c++语言-01 method using dynamic programming knapsack problem, language background is c++ language
shortest-route-problem
- 最短路径问题的四种实现方式:广度优先、深度优先、贪心法、动态规划法、穷举法、回溯法。-Four ways to achieve the shortest path problem breadth priority greedy depth-first dynamic programming method exhaustive backtracking
awswsi1
- 该程序是一个动态规划法解决装配线调度问题的小程序,是用C++做的,()