1·Another matrix associated with G is the adjacency matrix.
伴随于G的另一个矩阵是邻接矩阵。
2·The edges for this step can be found in the adjacency matrix.
此步骤的边可以在邻接矩阵中找到。
3·How to read this graph input and put into an adjacency matrix?
如何把这个图形输入和投入一个邻接矩阵？
4·There is the relationship between the graph and the adjacency matrix.
图与其邻接矩阵之间有着一一对应的关系。
5·Adjacency matrix of the storage structure of the graph for the DFS and BFS traversals.
对以邻接矩阵为存储结构的图进行DFS和BFS遍历。
6·Three methods of computing accessibility matrix from adjacency matrix are introduced in this paper.
介绍了由邻接矩阵求可达性矩阵的三个方法。
7·Based on the adjacency matrix of the network graph, the theoretical proof of the topological arithmetic is given.
以图论中邻接矩阵为基础，给出了该算法的理论证明。
8·The basic relation matrix is automatically generated finally through data transform by using the adjacency matrix.
通过数据转化，利用邻接矩阵生成管网基本关系矩阵。
9·With the adjacency matrix of undirected networks, should show the selected villages to the shortest distance of the village.
用邻接矩阵表示无向网，应显示所选中的村庄到各村庄的最短距离。
10·Using graph theory of adjacency matrix as a conversion, a depth-first search to the entire map, can be cut at all possible paths.
利用图论中的邻接矩阵作为转换点，深度优先搜索整个有向图，可以得到所有可能的切分形式。