Every edge in the adjacency graph corresponds to exactly one edge in the shape graph.
邻接图的每条边都对应于形状图的边缘。
According to the marker image, the image is stored in the form of region adjacency graph.
根据标记图像，将图像以区域邻接图的方式进行存储。
Scanned engineering drawings are self- organizationally recognized based on Primitive Region Adjacency Graph (PRAG).
本文提出基于单义域邻接图的扫描工程图样自组织智能识别。
The paper presents a method to recognize integral lines in scanned image of engineering drawings based on a primitive regions adjacency graph.
给出一种基于单义域邻按图的完整识别线段算法。
This paper discusses the scheme of region oriented run-length coding and the judgement of spatial relationship between regions and the access mode of region adjacency graph in computer.
本文讨论了面向区域的游程编码表示方案，在此基础上给出了判断区域之间空间关系的算法，并对关系图在计算机中的存储做了研究。
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.
对邻接矩阵在图的遍历、最小生成树、拓扑排序和关键路径等算法分析上的应用作了一定的探讨。
How to read this graph input and put into an adjacency matrix?
如何把这个图形输入和投入一个邻接矩阵？
In this thesis, we investigate the application of graph spectra on the energy and the properties of the adjacency matrix of graphs.
本文我们研究谱图理论在图的能量及图的邻接矩阵的性质方面的应用。
Fault Diagnosis is based on the event correlation, graph theory and adjacency matrix are two methods to get the root failure sets.
故障关联算法依据故障之间的关联关系，运用图论和邻接矩阵的方法求出根故障集。
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.
判断图同构的一种有用的方法是对图的邻接矩阵进行初等变换，变成另一个图的邻接矩阵。
Based on the adjacency matrix of the network graph, the theoretical proof of the topological arithmetic is given.
以图论中邻接矩阵为基础，给出了该算法的理论证明。
Adjacency matrix of the storage structure of the graph for the DFS and BFS traversals.
对以邻接矩阵为存储结构的图进行DFS和BFS遍历。
Using graph theory of adjacency matrix as a conversion, a depth-first search to the entire map, can be cut at all possible paths.
利用图论中的邻接矩阵作为转换点，深度优先搜索整个有向图，可以得到所有可能的切分形式。
There is the relationship between the graph and the adjacency matrix.
图与其邻接矩阵之间有着一一对应的关系。
Finally, a particular description of a route searching algorithm is given based on graph data structure of an adjacency list.
详细地论述了基于邻接表图形数据结构的进路搜索算法，并给出了完整的描述。
And the key nodes and the adjacency between nodes can be reflected by the adjacent matrix of the master network graph.
主网络图的邻接矩阵反映了各节点间的邻接关系和关键节点。
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.
有向图的邻接矩阵比较容易建立，但是在建立结构模型时，更有用的是要素间的可达关系。
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表示的图的传递闭包。
Even on the form to input an undirected graph edge, the establishment of the adjacency matrix to determine whether the connectivity graph (a).
以偶对的形式输入一个无向简单图的边，建立该图的邻接矩阵，判断图是否连通(A)。
Even on the form to input an undirected graph edge, the establishment of the adjacency matrix to determine whether the connectivity graph (a).
以偶对的形式输入一个无向简单图的边，建立该图的邻接矩阵，判断图是否连通(A)。
应用推荐