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.
对邻接矩阵在图的遍历、最小生成树、拓扑排序和关键路径等算法分析上的应用作了一定的探讨。
2
The topological relationship of nodes and road sections in road network was expressed by adjacent node relation matrix and adjacent node weight matrix, which saved the storage space.
采用邻接结点关系矩阵和邻接结点权矩阵表达路网中结点和路段的拓扑关系，减少了路网的存储空间。
3
For infinite matrices of linear and some nonlinear mappings between topological vector spares which have not any restriction, we establish a new result of infinite matrix transformations.