邻接

基本解释 (translations)

abut  ·  abutment  ·  abuttal  ·  adjacency  ·  adjoin  ·  confine  ·  neighbor  ·  neighbour  ·  neighbourhood  ·  adjoined  ·  neighbored  ·  abuts  ·  abutted  ·  adjacencies  ·  adjoins  ·  neighboured

词组短语

be next to · be contiguous to · abut against · abut on · abut upon

与邻接相关的网络例句 [注：此内容来源于网络，仅供参考]

Map storage structure can be: adjacency matrix, adjacency table.

图的存储结构可采用：邻接矩阵、邻接表。

The adjacent matrix is a matrix, which, if and only if vertex and adjacent.

的邻接矩阵是一个的矩阵，其中，当且仅当顶点和邻接。

Triangleadj assumes that every other vertex is an adjacent vertex.

邻接三角形假设三角形每个顶点都有邻接的顶点。

A hierarchy and circularity of data structure was presented by analyzed STL files and compared a several of frequently used data structures. The structure acquired from redundancy vertex was filtered by vertex sequence of quick sort, and vertex adjacent list and triangle face adjacent list was established.

通过对STL文件的分析和几种常用数据结构的比较，给出了一种层次环状数据结构，该结构是由快速排序顶点序列进行冗余顶点滤除，并建立顶点邻接表和三角面片邻接表而得到的。

Abutting lots; adjoining rooms; Rhode Island has two bordering states; Massachusetts and Conncecticut; the side of Germany conterminous with France; Utah and the contiguous ''.

邻接地段；邻接的房间；罗得岛有两个相互接壤的''。

Adjacency search, double linked element list, random direction search, adjacency rotation, and heredity of geometrical quantities are applied to increase the efficiency of mesh generation. The relationship between the computing time and the number of generated elements is nearly linear and the time complexity is O(N^1.05), where N is the number of elements.

采用了邻接单元搜索、双向链表存储、随机方向搜索、邻接旋转、几何量继承等技术，使算法的计算时间与生成单元数近似呈线性关系，时间复杂度达到O(N^1.05)，N为生成单元数。

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.

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

Adopt incidence matrix to express network topology. Through searching and revising the incidence matrix, the zoned feeder and its network equivalent process are realized.

采用邻接矩阵表示网络拓扑，通过对邻接矩阵的搜索和修改实现馈线的分区以及网络的等值过程。

In this paper, firstly, not only the incidence matrix ,adjacent matrix, cycle matrix, cut-set matrix of an undirected graph are summarized, but also the close contact between a graph and its corresponding matrix are discussed ; secondly, many problems of a graph which are solved by analysing its matrix are listed as follows:1、The co-tree set of a graph is obtained by using its cycle-matrix ; 2、The branches of its spanning tree are given by using its cut-set matrix ; 3、By making use of the incidence matrix of a graph ,not only its vertex cut 、cut vertex 、isolated point and spanning tree can be obtained ,but also the two sides which are whether parallel or not can be judged ;4、By using their adjacent matrix ,the two graphes which are whether isomorphous or not can be judged; once more, there is a detailed introduction in view of special graph (for example: bigaritite graph ,regular graph and so on);last but not least, a graph method of calculating the N power of a matrix is given and the practical applications of the theorem for degree is indicated.

本文首先综述了无向图的关联矩阵，邻接矩阵，圈矩阵，割集矩阵以及图和它对应矩阵之间的关系；其次总结出了利用上述各类矩阵可以解决的图的若干问题：1、利用图的圈矩阵可以求其连枝集；2、利用图的割集矩阵可以求其生成树的树枝；3、利用图的关联矩阵不仅可以求其割点、点割集、连通度、孤立点和生成树，而且可以判断两条边是否平行；4、利用图的邻接矩阵可以判断两个图是否同构；再次，针对特殊图（例如：二分图、正则图等等）的邻接矩阵作了详细介绍；最后，得到了利用图计算矩阵的N次幂的方法，指出度数定理的实际应用。

These experiments results prove the combination of QP and clustering methods such as neighbor joining and Weighbor is efficient.

需要指出的是，邻接法和QP的结合不是唯一的，任意类似于邻接法的聚类过程如Weightor都可以按照QPNJ的思想代替邻接法与QP相结合。

与邻接相关的网络解释 [注：此内容来源于网络，仅供参考]

abut upon：邻接

abut on 邻接 | abut upon 邻接 | abut 邻接

abut upon：邻接, 紧靠

abut on | 邻接, 紧靠 | abut upon | 邻接, 紧靠 | abut | 邻接, 毗邻

abut on：邻接

abut against 邻接 | abut on 邻接 | abut upon 邻接

abut on：邻接, 紧靠

abut against | 邻接, 紧靠 | abut on | 邻接, 紧靠 | abut upon | 邻接, 紧靠

adjacency list：邻接表

(2)图的邻接表表示法 邻接表(adjacency list)是对图中的每个顶点建立一个邻接关系的单 链表,并把它们的表头指针用向量存储的一种图的表示方法.为顶点 v i 建立的邻接关系的单链表称作 v i 邻接表.v i 邻接表中的每个结 点用来存储以该顶点为端点或起点的一条边的信息,

conterminous：相连的 邻接 邻接的

conterminal 相连的 | conterminous 相连的 邻接 邻接的 | contest 竞 竞 竞赛 竞赛

noncontiguous item：非连续项,非邻接数据项,非邻接项,独立项

noncontiguous data 非邻接数据 | noncontiguous item 非连续项,非邻接数据项,非邻接项,独立项 | noncontiguous page 非邻接页,非邻接页面

noncontiguous data：非邻接数据

noncontemporaneous error 非同时发生的误差 | noncontiguous data 非邻接数据 | noncontiguous item 非连续项,非邻接数据项,非邻接项,独立项

noncontiguous page：非邻接页,非邻接页面

noncontiguous item 非连续项,非邻接数据项,非邻接项,独立项 | noncontiguous page 非邻接页,非邻接页面 | noncontiguous working-storage 独立工作存储器

adjacent-1 distribution;nonhomologous adjacent distribution;nondisjunctional distribution：邻接-1分布;非同型染色体邻接分布;不分离分布

"邻接分离","adj... | "邻接-1分布;非同型染色体邻接分布;不分离分布","adjacent-1 distribution;nonhomologous adjacent distribution;nondisjunctional distribution" | "邻接-2分布;非同型染色体邻接分布;不分离分...