文献类型：期刊文献

中文题名：最大路径算法在原条量材优化中的应用及其优化

英文题名：Application and Optimization of Longest Path Algorithm in Tree-Length Scaling

作者：尤磊[1,2] 符利勇[2] 宋新宇[1]

第一作者：尤磊

机构：[1]信阳师范学院计算机与信息技术学院;[2]中国林业科学研究院资源信息研究所

年份：2014

卷号：27

期号：4

起止页码：605-609

中文期刊名：信阳师范学院学报：自然科学版

收录：CSTPCD;;北大核心:【北大核心2011】；

基金：河南省省院合作项目(122106000052);河南省基础与前沿技术研究计划项目(122300410372);河南省教育厅科学技术研究重点项目(12B520051);信阳师范学院青年基金项目

语种：中文

中文关键词：原条量材;最短路径;最大路径;拓扑排序

外文关键词：tree-length scaling;the shortest path;the longest path;topological sort

分类号：TP311

摘要：在分析求解最短路径问题与求解最大路径问题差异的基础上,给出了一种在有向图中采用动态规划策略求解最大路径的算法,将其应用到原条量材网络图中求解原条最优量材问题;并提出了采用量材三角形优化原条量材网络图的一种优化方法,降低了算法的复杂度.通过实验验证了算法与优化方法的正确性与可行性.
Based on the analysis of the similarities and differences between solving the shortest path problem and solving the longest path problem, an algorithm using the dynamic programming strategy was given to solve the longest problem in directed graph. The algorithm was applied to the tree-length scaling network to solve the optimal tree-length scaling problem. An optimization method using the tree-length scaling triangle was proposed to optimize tree-length scaling network. It reduced the complexity of the algorithm. The correctness and feasibility of the algorithm and optimi-zation methods were verified through the experiments.