Location:
Search - duoduantu
Search list
Description: 经典算法代码--多段图问题。附有详细的注释，很容易看懂。
Platform: |
Size: 1251 |
Author: 刃具 |
Hits:
Description: 多段图动态规划算法.好东西不容错过.值得参考.
Platform: |
Size: 867 |
Author: 罗瑞海 |
Hits:
Description: 这是计算机算法基础中的动态规划的方法的一个例子，多段图是一个很经典的问题！这里的程序用于求解最小成本路径，用类似的思想可以解决最优分配方案的问题！-This is a computer algorithm based on the dynamic programming methods of an example, many of the map is a classic question! Here the procedures for calculating the minimum cost path, with similar ideas can solve the optimal distribution program!
Platform: |
Size: 5875 |
Author: 中国 |
Hits:
Description: 这是计算机算法基础中的动态规划的方法的一个例子，多段图是一个很经典的问题！这里的程序用于求解最小成本路径，用类似的思想可以解决最优分配方案的问题！-This is a computer algorithm based on the dynamic programming methods of an example, many of the map is a classic question! Here the procedures for calculating the minimum cost path, with similar ideas can solve the optimal distribution program!
Platform: |
Size: 5120 |
Author: 中国 |
Hits:
Description: 经典算法代码--多段图问题。附有详细的注释，很容易看懂。-Classical algorithm code multi-segment graph problems. With detailed explanatory notes, it is easy to understand.
Platform: |
Size: 1024 |
Author: 刃具 |
Hits:
Description: 多段图动态规划算法.好东西不容错过.值得参考.-Multi-stage dynamic programming algorithm Fig. Good things should not be missed. It is also useful.
Platform: |
Size: 1024 |
Author: 罗瑞海 |
Hits:
Description: 使用动态规划算法解决多段图问题，适合算法分析与设计的学习-Using dynamic programming algorithm to solve the issue of multi-stage plan for the learning algorithm analysis and design of
Platform: |
Size: 126976 |
Author: smile |
Hits:
Description: 算法基础关于多段图的c++程序源代码下载。-Algorithm based on Multi-map c++ source code download.
Platform: |
Size: 14336 |
Author: 王博雅 |
Hits:
Description: 这是一个多段图问题，里面含有教程和详细的编码内容，可以让初学者一目了然。-Multistage Graph
Platform: |
Size: 8192 |
Author: chenyuanja |
Hits:
Description: 这是我自己写的多段图的程序，是算法实验，供新手学习使用-This is my own writing multi-stage program, algorithm experiments for the novice to learn to use
Platform: |
Size: 66560 |
Author: 阿克瓦力 |
Hits:
Description: 多段图问题的动态规划算法与实现
功能：求源点到汇点的最短路径及决策过程。
要求：用向前处理和向后处理方法分别对给出的数据，进行求解（注意在文档中画出多段图）。给出复杂性分析。
输入：多段图的段数，顶点数，以及每条边的权重。
输出：多段图的最短路径和决策过程。
-Many of the map of the dynamic programming algorithm and implementation features: seeking the source point to the Meeting Point of the shortest path and the decision-making process. Requirements: forward and backward approach given data to solve (Note that in the document to draw more of the map). Given the complexity of the analysis. Input: Multi-segment, the number of vertices, and the weight of each edge. Output: the shortest path and the decision-making process more of the map.
Platform: |
Size: 16384 |
Author: missli |
Hits: