查询词典 adjacency matrix

Map-building, there are several plans to choose, you can choose to graph traversal method, which the storage structure of the plan is based on vertex adjacency matrix of the array and stored the.

详细说明：图的建立，有多种的图可以选择，也可以选择图的遍历方法，里面的图的存储结构是以顶点数组和邻接矩阵的方式存储的。

In the adjacency matrix based on the use of sets of elementary transformation method for traveling salesman problem is discussed, given this problem a feasible solution.

详细说明：在邻接矩阵的基础上利用成套初等变换的方法，对旅行商问题进行了探讨，给出此问题一个可行的求解方法。

The input of integer pair, the output of a graph adjacency matrix.

详细说明：根据输入的整数对，输出一个图形的邻接矩阵。

This paper presents an adjacency matrix method for identifying topological symmetry to planar kinematic chain s with multiple joints.

提出了识别含复铰平面运动链拓扑对称性的邻接矩阵方法。

Although the adjacency matrix was a storage structure of finite automaton in common use, it was not proper to store all kinds of finite automata.

尽管邻接矩阵是有穷自动机的一种常用存储方法，但是，邻接矩阵并不适合存储所有类型的有穷自动机。

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 is successful.

利用该算法，只需输入管道网络的邻接矩阵，即可自动产生流量压力分布计算的数学模型并进行实时动态求解。并成功将它们应用于实践中，效果良好。

Since all elements on the primary diagonal are 1' s and the dimensions are less than 2006, the graph with A 2006 as its adjacency matrix is the transitive closure of the graph represented by A .

由于主对角线上的元素都是1，而且矩阵的阶小于2006，所以为 A 2006邻接矩阵的图就是由 A 表示的图的传递闭包。

Traverse the adjacent table and adjust the implementation of Boolean adjacency matrix data structure is a classic graph algorithm.

详细说明：遍历邻接表以及执行邻接矩阵布尔调整是数据结构里图的经典算法。

The design is the preparation of plans and the establishment of export, the use of storage structure order to establish a map and undirected graph, Output of adjacency matrix and map the depth and breadth of priority traversal sequence.

本设计是编写关于图的建立以及输出，使用顺序存储结构建立有向图和无向图，输出图的邻接矩阵以及图的深度优先和广度优先遍历次序。

Master plan adjacency matrix storage structure; Implementation plans of the two traverse : depth-first traversal and breadth traversal priority.

掌握图的邻接矩阵的存储结构；实现图的两种遍历：深度优先遍历和广度优先遍历。

The teacher likes the honeymouthed little girl very much.

老师很喜欢这个嘴甜的小姑娘。

Mr. Notker Bien's interests are traveling, spending quality time with the family and long-distance-running.

诺特卡·柏恩先生热爱旅游，长跑，以及和家人一起共度美好时光。