Another matrix associated with G is the adjacency matrix.
伴随于G的另一个矩阵是邻接矩阵。
The edges for this step can be found in the adjacency matrix.
此步骤的边可以在邻接矩阵中找到。
There is the relationship between the graph and the adjacency matrix.
图与其邻接矩阵之间有着一一对应的关系。
Three methods of computing accessibility matrix from adjacency matrix are introduced in this paper.
介绍了由邻接矩阵求可达性矩阵的三个方法。
Based on the adjacency matrix of the network graph, the theoretical proof of the topological arithmetic is given.
以图论中邻接矩阵为基础，给出了该算法的理论证明。
The basic relation matrix is automatically generated finally through data transform by using the adjacency matrix.
通过数据转化，利用邻接矩阵生成管网基本关系矩阵。
Fault Diagnosis is based on the event correlation, graph theory and adjacency matrix are two methods to get the root failure sets.
故障关联算法依据故障之间的关联关系，运用图论和邻接矩阵的方法求出根故障集。
In this thesis, we investigate the application of graph spectra on the energy and the properties of the adjacency matrix of graphs.
本文我们研究谱图理论在图的能量及图的邻接矩阵的性质方面的应用。
A new method of obtaining linkage characteristic polynomials based on the adjacency matrix of the kinetic chain is presented in the paper.
本文介绍了一种建立在运动链关联矩阵基础上求解运动链特性多项式的新方法。
Through the adjacency matrix, computing networks, clustering coefficient. Clustering coefficient is a complex network, an important parameter.
通过邻接矩阵，计算网络的聚类系数。聚类系数是复杂网络中一个重要参量。
One helpful way to determine the isomorphism of graphs is to use elementary operations on a graph adjacency matrix so as to transform one matrix into another.
判断图同构的一种有用的方法是对图的邻接矩阵进行初等变换，变成另一个图的邻接矩阵。
Construct the skeleton tree′s adjacency matrix, then define a Topology Signature Vector and compute the distance of matching node pair by the difference of the TSV.
构造骨架树邻接矩阵并给出拓扑标记向量的定义，用拓扑标记向量之差的二范数作为两个骨架树匹配节点对的距离；
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.
对邻接矩阵在图的遍历、最小生成树、拓扑排序和关键路径等算法分析上的应用作了一定的探讨。
Adjacency matrix of the storage structure of the graph for the DFS and BFS traversals.
对以邻接矩阵为存储结构的图进行DFS和BFS遍历。
The Adjacency Matrix of the Directed Graph is easy to build, but the reach-relation of factors is more useful when building the structure model.
有向图的邻接矩阵比较容易建立，但是在建立结构模型时，更有用的是要素间的可达关系。
The Adjacency Matrix of the Directed Graph is easy to build, but the reach-relation of factors is more useful when building the structure model.
有向图的邻接矩阵比较容易建立，但是在建立结构模型时，更有用的是要素间的可达关系。
应用推荐