摘要
数据结构是计算机学科的算法理论基础和软件设计的技术基础,在计算机领域中有着举足轻重的作用。利用邻接矩阵表的存储结构,实现了在计算机上求关键路径的算法,并分析了所设计算法的时间复杂度。
The date structure, which is the algorithm theory base of the computer science and the technological base of the software design, plays an important role in the computer area. This paper realizes the algorithm for getting the critical path on the computer by using the saving structure of the contiguous matrix list, and analyzes on the time complexity of the designed algorithm.
出处
《科技情报开发与经济》
2007年第8期166-167,共2页
Sci-Tech Information Development & Economy
关键词
数据结构
关键路径
算法
data structure
critical path
algorithm
