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.
对邻接矩阵在图的遍历、最小生成树、拓扑排序和关键路径等算法分析上的应用作了一定的探讨。
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.
采用邻接结点关系矩阵和邻接结点权矩阵表达路网中结点和路段的拓扑关系，减少了路网的存储空间。
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.
讨论了抽象对偶系统中的向量值无穷矩阵变换，在一个所涉拓扑线性空间没有任何限制的情况下，得到了无穷矩阵变换理论的一个新结果。
It is proposed a new topological method of adjacent matrix of esters which was constructed by taking the characteristic value of the pieces of ester compounds as principal diagonal element.
提出了拓扑方法，即考虑分子图顶点的性质，直接用酯类化合物的分子碎片的特征值为主元来构建邻接矩阵。
The connected matrix of topological relationships between vertices was renewed by occlusion matrix, and the projection drawing defined by connected matrix had no hidden line.
利用遮挡矩阵更新表示顶点间拓扑关系的连接矩阵，得到不含隐藏线的投影图。
On the basis of the principle, the OET (orbital-energy topological index) was proposed by revising the valence electron distance matrix with the orbital energy.
根据该原理，利用价电子轨道能量对价电子距离矩阵进行修正。
Based on the adjacency matrix of the network graph, the theoretical proof of the topological arithmetic is given.
以图论中邻接矩阵为基础，给出了该算法的理论证明。
Based on the adjacency matrix of the network graph, the theoretical proof of the topological arithmetic is given.
以图论中邻接矩阵为基础，给出了该算法的理论证明。
应用推荐