摘要
对邻接矩阵在图的遍历、最小生成树、拓扑排序和关键路径等算法分析上的应用作了一定的探讨。
This paper discusses the application of adjacency matrix at the algorithm's analysis for traversing Graph, Minimum cost Spanning Tree, Topological sort and Critical Path.
出处
《郴州师范高等专科学校学报》
2000年第6期19-23,共5页
Journal of Chenzhou Teachers College
关键词
邻接矩阵
最小生成树
拓扑排序
关键路径
adjacency matrix
graph
minimum cost spanning tree
topological sort
critical path
