CAJ | 학술논문

在分析求解最短路径问题与求解最大路径问题差异的基础上，给出了一种在有向图中采用动态规划策略求解最大路径的算法，将其应用到原条量材网络图中求解原条最优量材问题；并提出了采用量材三角形优化原条量材网络图的一种优化方法，降低了算法的复杂度。通过实验验证了算法与优化方法的正确性与可行性。
재분석구해최단로경문제여구해최대로경문제차이적기출상，급출료일충재유향도중채용동태규화책략구해최대로경적산법，장기응용도원조량재망락도중구해원조최우량재문제；병제출료채용량재삼각형우화원조량재망락도적일충우화방법，강저료산법적복잡도。통과실험험증료산법여우화방법적정학성여가행성。
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.