一种基于动态规划法的关键路径算法  

A Critical Path Algorithm Based on Dynamic Programming

作　　者：詹泽梅[1] ZHAN Ze-mei(Computer Science College of Yangtze University,Jingzhou 434023,China)

机构地区：[1]长江大学计算机科学学院

出　　处：《电脑知识与技术》2019年第11期215-217,共3页Computer Knowledge and Technology

摘　　要：数据结构是计算机及其相关专业的一门重要专业课。在数据结构课程中,关键路径是一个难点问题。本文首先概述了关键路径问题,接着介绍了动态规划法,分析其求解关键路径的可行性,最后重点描述了采用十字链表存储有向图时的一种基于动态规划法的关键路径求解算法。Data structure is an important professional course for computer and related majors.In the course of data structure,critical path is a difficult problem.Firstly,this paper outlines the critical path problem.Then,it introduces the dynamic programming,and anal⁃yses the feasibility of solving the critical path.Finally,it focuses on the critical path algorithm Based on dynamic programming when the directed graph is stored using orthogonal list.

关 键 词：关键路径 动态规划法 十字链表 AOE-网 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]