此步骤的边可以在邻接矩阵中找到。
The edges for this step can be found in the adjacency matrix.
伴随于G的另一个矩阵是邻接矩阵。
图与其邻接矩阵之间有着一一对应的关系。
There is the relationship between the graph and the adjacency matrix.
如何把这个图形输入和投入一个邻接矩阵？
How to read this graph input and put into an adjacency matrix?
介绍了由邻接矩阵求可达性矩阵的三个方法。
Three methods of computing accessibility matrix from adjacency matrix are introduced in this paper.
通过数据转化，利用邻接矩阵生成管网基本关系矩阵。
The basic relation matrix is automatically generated finally through data transform by using the adjacency matrix.
以图论中邻接矩阵为基础，给出了该算法的理论证明。
Based on the adjacency matrix of the network graph, the theoretical proof of the topological arithmetic is given.
通过有向图的邻接矩阵的轨道来刻划图的哈密顿圈问题。
According to the orbit of adjoining matrix of directed graph the problem of Hamiltonian cycle is described.
对以邻接矩阵为存储结构的图进行DFS和BFS遍历。
Adjacency matrix of the storage structure of the graph for the DFS and BFS traversals.
还提出了一种基于节点邻接矩阵的快速可观测性分析方法。
In addition a speedy observability analysis method based on nodal adjacent matrix is put forward.
主网络图的邻接矩阵反映了各节点间的邻接关系和关键节点。
And the key nodes and the adjacency between nodes can be reflected by the adjacent matrix of the master network graph.
据此，提出用图论和矩阵重现目标网络拓扑结构的邻接矩阵法。
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 presented a classification method to planar kinematic chains with multiple joints and higher pairs based on structural characteristics.
面对满足二维空间邻接条件的聚类问题，定义了邻接矩阵的概念。
In order to dealing with the clustering considering the condition of planar adjacency relationship, the concept adjacency matrix is defined.
用邻接矩阵表示无向网，应显示所选中的村庄到各村庄的最短距离。
With the adjacency matrix of undirected networks, should show the selected villages to the shortest distance of the village.
本文我们研究谱图理论在图的能量及图的邻接矩阵的性质方面的应用。
In this thesis, we investigate the application of graph spectra on the energy and the properties of the adjacency matrix of graphs.
本文给出一种新的编码方案，与邻接矩阵编码具有相同的空间复杂度。
A new encoding method is given which has the same complexity as adjacent matrix encoding.
通过邻接矩阵，计算网络的聚类系数。聚类系数是复杂网络中一个重要参量。
Through the adjacency matrix, computing networks, clustering coefficient. Clustering coefficient is a complex network, an important parameter.
另外通过用邻接矩阵表示IPT小组的组织视图和资源视图与其它模型的关系。
In addition, the relationship of organization view and resources view in IPT group with other models is represented by adjacency matrices.
在活动识别阶段，通过邻接矩阵、可达矩阵和强连通矩阵，对耦合活动进行识别。
In activities identification phase, coupled activities was identified by Boolean operation of adjacent matrix, accessible matrix and strong connected matrix.
本文详细地阐述了网络拓扑分析中两种常用的分析方法：邻接矩阵法和树搜索法。
This paper sets forth the two methods for topology analysis: neighboring matrix method and tree_search method, which are in common use.
故障关联算法依据故障之间的关联关系，运用图论和邻接矩阵的方法求出根故障集。
Fault Diagnosis is based on the event correlation, graph theory and adjacency matrix are two methods to get the root failure sets.
该系统利用关系数据库模型存储设备的参数信息，构造邻接矩阵记录电网的拓扑结构。
In the system, Relation database model is adopted to memory the parameter information of the device, and the adjacent matrix is used to memory the network topology of power system.
该算法通过引入邻接矩阵并借助自定义的堆栈数据结构来完成控制流路径子集的生成。
The control flow paths in the subset are based on the strategy that the loop statements in the program execute less than twice.
以偶对的形式输入一个无向简单图的边，建立该图的邻接矩阵，判断图是否连通(A)。
Even on the form to input an undirected graph edge, the establishment of the adjacency matrix to determine whether the connectivity graph (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.
判断图同构的一种有用的方法是对图的邻接矩阵进行初等变换，变成另一个图的邻接矩阵。
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.
建立动态bom和动态工艺路线，用邻接矩阵理论来解决协同企业之间的动态工艺路线问题。
It has established dynamic BOM (bill of materials) and dynamic technology route, solved the dynamic technology route problem between the coordination enterprises with the adjacent matrix theory.
利用图论中的邻接矩阵作为转换点，深度优先搜索整个有向图，可以得到所有可能的切分形式。
Using graph theory of adjacency matrix as a conversion, a depth-first search to the entire map, can be cut at all possible paths.
对邻接矩阵在图的遍历、最小生成树、拓扑排序和关键路径等算法分析上的应用作了一定的探讨。
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.
应用推荐