Another matrix associated with G is the adjacency matrix.
伴随于G的另一个矩阵是邻接矩阵。
The edges for this step can be found in the adjacency matrix.
此步骤的边可以在邻接矩阵中找到。
How to read this graph input and put into an adjacency matrix?
如何把这个图形输入和投入一个邻接矩阵？
There is the relationship between the graph and the adjacency matrix.
图与其邻接矩阵之间有着一一对应的关系。
Adjacency matrix of the storage structure of the graph for the DFS and BFS traversals.
对以邻接矩阵为存储结构的图进行DFS和BFS遍历。
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.
通过数据转化，利用邻接矩阵生成管网基本关系矩阵。
With the adjacency matrix of undirected networks, should show the selected villages to the shortest distance of the village.
用邻接矩阵表示无向网，应显示所选中的村庄到各村庄的最短距离。
Using graph theory of adjacency matrix as a conversion, a depth-first search to the entire map, can be cut at all possible paths.
利用图论中的邻接矩阵作为转换点，深度优先搜索整个有向图，可以得到所有可能的切分形式。
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.
本文我们研究谱图理论在图的能量及图的邻接矩阵的性质方面的应用。
There are go-return route and out-in routes in bus route, use the method of better adjacency matrix to implement this kind of bus change.
针对公交线路中存在往返路线不一致、内外线路等情况，对用改进的邻接矩阵方法实现这一类型的公交换乘进行了研究。
A new method of obtaining linkage characteristic polynomials based on the adjacency matrix of the kinetic chain is presented in the paper.
本文介绍了一种建立在运动链关联矩阵基础上求解运动链特性多项式的新方法。
In order to dealing with the clustering considering the condition of planar adjacency relationship, the concept adjacency matrix is defined.
面对满足二维空间邻接条件的聚类问题，定义了邻接矩阵的概念。
Through the adjacency matrix, computing networks, clustering coefficient. Clustering coefficient is a complex network, an important parameter.
通过邻接矩阵，计算网络的聚类系数。聚类系数是复杂网络中一个重要参量。
Even on the form to input an undirected graph edge, the establishment of the adjacency matrix to determine whether the connectivity graph (a).
以偶对的形式输入一个无向简单图的边，建立该图的邻接矩阵，判断图是否连通(A)。
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.
有向图的邻接矩阵比较容易建立，但是在建立结构模型时，更有用的是要素间的可达关系。
According this, the method that can reproduce the topology structure of the object network by using figure theory and adjacency matrix was discussed.
据此，提出用图论和矩阵重现目标网络拓扑结构的邻接矩阵法。
This paper also proposes the qualities of adjacency matrix, derives the theorem of the relations between isomorphism and equivalent adjacency matrix.
提出关联矩阵的性质，推导出同型机构和等价关联矩阵关系的定理。
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.
对邻接矩阵在图的遍历、最小生成树、拓扑排序和关键路径等算法分析上的应用作了一定的探讨。
After turning it into a Designate Problem and analyzing the opposite angles of a rectangle in the Adjacency Matrix about its figure, this paper gives an approximate algorithm about it.
本文把它转化为增加限制条件的指派问题，对图邻接矩阵矩形对角进行分析，给出了这一问题的一个较好近似算法。
It is shown that after the adjacency matrix of flow network is input, the algorithm can be employed to generate the model of flow network automatically and the practice with this method I...
利用该算法，只需输入管道网络的邻接矩阵，即可自动产生流量压力分布计算的数学模型并进行实时动态求解。
Since all elements on the primary diagonal are 1s and the dimensions are less than 2006, the graph with A2006 as its adjacency matrix is the transitive closure of the graph represented by a.
由于主对角线上的元素都是1，而且矩阵的阶小于2006，所以为a2006邻接矩阵的图就是由A表示的图的传递闭包。
In this paper, we get the diameter of three kind of self-complementary and then give a necessary and sufficient condition from matrix adjacency when the diameter is 2 or 3.
本文给出了三种类型的自补图关于直径方面的结果，并从自补图的邻接矩阵给出了自补图直径为2或3的一个充要条件。
With the results of the algorithms, side adjacency direction matrix for boundary quadrants can be defined.
利用这些算法的执行结果，可以定义一个边界四分形的边邻接方向矩阵。
And the key nodes and the adjacency between nodes can be reflected by the adjacent matrix of the master network graph.
主网络图的邻接矩阵反映了各节点间的邻接关系和关键节点。
And the key nodes and the adjacency between nodes can be reflected by the adjacent matrix of the master network graph.
主网络图的邻接矩阵反映了各节点间的邻接关系和关键节点。
应用推荐