通过有向图的邻接矩阵的轨道来刻划图的哈密顿圈问题。
According to the orbit of adjoining matrix of directed graph the problem of Hamiltonian cycle is described.
主网络图的邻接矩阵反映了各节点间的邻接关系和关键节点。
And the key nodes and the adjacency between nodes can be reflected by the adjacent matrix of the master network graph.
本文我们研究谱图理论在图的能量及图的邻接矩阵的性质方面的应用。
In this thesis, we investigate the application of graph spectra on the energy and the properties of the adjacency matrix of graphs.
以偶对的形式输入一个无向简单图的边，建立该图的邻接矩阵，判断图是否连通(A)。
Even on the form to input an undirected graph edge, the establishment of the adjacency matrix to determine whether the connectivity graph (a).
判断图同构的一种有用的方法是对图的邻接矩阵进行初等变换，变成另一个图的邻接矩阵。
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.
有向图的邻接矩阵比较容易建立，但是在建立结构模型时，更有用的是要素间的可达关系。
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.
给出了应用瞬心速度图的邻接矩阵自乘求解机构全部瞬心速度及求解给定瞬心速度最短路经的方法。
Finally, the methods to find all instant center velocities and the shortest path leading to any instant center velocity of a mechanism using square adjacent matrices are explained.
图与其邻接矩阵之间有着一一对应的关系。
There is the relationship between the graph and the adjacency matrix.
本文把它转化为增加限制条件的指派问题，对图邻接矩阵矩形对角进行分析，给出了这一问题的一个较好近似算法。
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.
本文以邻接矩阵作为图的存储结构，指出如何在计算机上实现克鲁斯·卡尔算法，并分析所设计算法的时间复杂度。
This text regards adjacent matrix as the memory structure of graph, and points out how to realize Kruskal algorithm in the computer, and analyses its complexity.
对邻接矩阵在图的遍历、最小生成树、拓扑排序和关键路径等算法分析上的应用作了一定的探讨。
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.
提出了拓扑方法，即考虑分子图顶点的性质，直接用酯类化合物的分子碎片的特征值为主元来构建邻接矩阵。
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.
利用图论中的邻接矩阵作为转换点，深度优先搜索整个有向图，可以得到所有可能的切分形式。
Using graph theory of adjacency matrix as a conversion, a depth-first search to the entire map, can be cut at all possible paths.
对以邻接矩阵为存储结构的图进行DFS和BFS遍历。
Adjacency matrix of the storage structure of the graph for the DFS and BFS traversals.
由于主对角线上的元素都是1，而且矩阵的阶小于2006，所以为a2006邻接矩阵的图就是由A表示的图的传递闭包。
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表示的图的传递闭包。
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.
应用推荐