adjacency
美 [?'d?e?s?ns?] 
英 [?'d?e?sns?]
- n.毗鄰；鄰接物；緊接在某一節(jié)目之前或之后的電視[廣播]節(jié)目
- 網(wǎng)絡(luò)鄰接關(guān)系；鄰近；相鄰
英漢解釋
n. | 3. 緊接在某一節(jié)目之前或之后的電視[廣播]節(jié)目 |
例句
Using graph theory of adjacency matrix as a conversion, a depth-first search to the entire map, can be cut at all possible paths.
利用圖論中的鄰接矩陣作為轉(zhuǎn)換點(diǎn)，深度優(yōu)先搜索整個(gè)有向圖，可以得到所有可能的切分形式。
The clustering algorithm considering the condition of planar adjacency relationship is defined again newly from the general clustering.
從聚類概念出發(fā)，重新定義了滿足二維空間鄰接條件聚類的概念。
The COUNT field contains the in-degree of that vertex and LINK is a pointer to the first node on the adjacency list.
該計(jì)數(shù)字段包含在度的頂點(diǎn)和LINK是對(duì)鄰接表上的第一個(gè)節(jié)點(diǎn)的指針。
Master graph adjacency list of definitions and applications, able to skillfully use the adjacency list.
掌握圖的鄰接表的定義及應(yīng)用，能夠熟練使用鄰接表。
Some preliminary analysis of the Adjacency List representation is presented, as well as some promising experimental results.
一些鄰接表表示，提出初步分析，以及一些有希望的實(shí)驗(yàn)結(jié)果。
This example defines the data as a triangle list without adjacency. The rest of the choices are listed in D3D10_PRIMITIVE_ TOPOLOGY .
這個(gè)例子定義了數(shù)據(jù)作為沒有鄰接信息的三角形條帶保存。其他的選擇在D3D10_PRIMITIVE_TOPOLOGY里列出。
Establishment of the adjacency matrix storage on the already established undirected graph depth first and breadth-first traversal operation.
建立無(wú)向圖的鄰接矩陣存儲(chǔ)；對(duì)已經(jīng)建立的無(wú)向圖進(jìn)行深度優(yōu)先和廣度優(yōu)先遍歷操作。
Front or its adjacency should have no obstacle that interfere public vision.
標(biāo)志的正面或其鄰近不能有妨礙公共視讀的障礙物。
Perhaps existing two arcs above in the same direction between two states, adjacency matrix could only record one of them.
原因是兩個(gè)狀態(tài)間可能有兩條以上同方向的弧，而鄰接矩陣只能記錄兩個(gè)狀態(tài)間存在的一條弧。
This paper presents an adjacency matrix method for identifying topological symmetry to planar kinematic chains with multiple joints.
提出了基于結(jié)構(gòu)特征的含復(fù)鉸和高副平面運(yùn)動(dòng)鏈的分類方法。
Adjacency innovations extend existing competencies and offer new products and services to already-familiar customers.
鄰近創(chuàng)新會(huì)延續(xù)現(xiàn)有優(yōu)勢(shì)，向已經(jīng)熟悉的客戶提供新產(chǎn)品和服務(wù)。
As is required by Adjacency Condition principle, a Case assignor and a Case recipient should stay adjacent to each other.
毗鄰條件決定格分派，該條件要求格分派者和格接受者要相互毗鄰。
UG is believed to contain a parameter wit the values (+ strict adjacency ) and (- strict adjacency ) set on the Adjacency Condition.
普遍語(yǔ)法被認(rèn)為包含一個(gè)參數(shù)，這個(gè)參數(shù)的意義是設(shè)置在毗鄰條件之上的（加嚴(yán)格毗鄰）和（減嚴(yán)格毗鄰）。
Establish a table to store the adjacency have already established the graph depth first and breadth-first traversal operation.
建立有向圖的鄰接表存儲(chǔ)；對(duì)已經(jīng)建立的有向圖進(jìn)行深度優(yōu)先和廣度優(yōu)先遍歷操作。
Create a storage structure of a given graph from the adjacency list and adjacency matrix are two ways to choose a store.
創(chuàng)建給定圖的存儲(chǔ)結(jié)構(gòu)，從鄰接表和鄰接矩陣兩種存儲(chǔ)方式中選擇一種。
The shortcomings about these days clustering algorithm considering the condition of planar adjacency relationship are analysised.
分析了目前滿足二維空間鄰接條件聚類算法的不足。
Adjacency table B. Which command will display only the current EIGRP routing table entries?
哪一條命令將只顯示出當(dāng)前？
Converts mesh adjacency information to an array of point representatives .
將網(wǎng)格鄰接信息轉(zhuǎn)換為點(diǎn)表示形式的數(shù)組。
These include: Adjacencies - Set to True to export mesh adjacency data, or False if you don't want adjacency data exported.
這些包括：鄰居-設(shè)定到真實(shí)出口網(wǎng)眼鄰居數(shù)據(jù)，或假如果你不想要鄰居，那么數(shù)據(jù)出口了。
Finally, adjacency is adopted to treat the prepositional phrase modifying several items.
第六，介詞短語(yǔ)修飾多個(gè)名詞時(shí)，譯者通常采用鄰近處理的技巧。
Two graphs are isomorphic if there is a correspondence between their vertex sets that preserves adjacency.
如果在兩個(gè)圖之間存在一個(gè)保持鄰接性的1-1對(duì)應(yīng)，則這兩個(gè)圖是同構(gòu)的。
It is applicable to polygon soups - models which contain no adjacency information, and obey no topological constraints.
它作用于不包括鄰接信息的多邊形模型，并且服從非拓?fù)?/c>約束。
It's very important that we find the right size, the right location and the right adjacency with other brands.
重要的是要找到大小合適的店面、合適的地點(diǎn)，還要注意與周邊品牌的協(xié)調(diào)。
It is now the Antipodean advantage of adjacency.
現(xiàn)在靠近亞洲是澳大利亞的大優(yōu)勢(shì)。
using adjacency list undirected graph storage to achieve the breadth-first traversal.
采用鄰接表存儲(chǔ)實(shí)現(xiàn)無(wú)向圖的廣度優(yōu)先遍歷。
First, the algorithm mines the data for frequent sequences and computes an adjacency lattice.
首先，該算法挖掘頻繁序列的數(shù)據(jù)并計(jì)算一個(gè)鄰接格。
The algorithm assumes that the network is represented by adjacency lists.
該算法假定網(wǎng)絡(luò)是由鄰接表表示。
Once an adjacency is formed between neighbors, link-state information is exchanged.
一旦鄰居間的鄰接性形成，鏈路狀態(tài)資訊即可交換。
The edges for this step can be found in the adjacency matrix.
此步驟的邊可以在鄰接矩陣中找到。
Nevertheless, source routing is based on a requirement that sender acknowledges the adjacency of participant in system.
然而，一方面，源路由方式要求發(fā)送者必須獲得匿名網(wǎng)絡(luò)中成員間的鄰接關(guān)系信息。
These spectrums can be calculated according to the component adjacency matrix that can be obtained from structure type synthesis.
通過(guò)結(jié)構(gòu)類型綜合獲得運(yùn)動(dòng)鏈的構(gòu)件鄰接矩陣后，就可以計(jì)算這些結(jié)構(gòu)特征。
First of all, an adjacency list should be established and its composition chiefly includes orientation, capacity, flux and so on.
首先創(chuàng)建鄰接表，其結(jié)構(gòu)包含邊的方向、容量、流量等信息。
Line Strip with Adjacency A line strip that also contains adjacency information.
線條帶也可以擁有鄰接信息。
This table is comparable to the adjacency database used by OSPF. There is a neighbor table for each protocol that EIGRP supports.
這表格可與OSPF所使用的相鄰資料庫(kù)相比較，EIGRP所支援的每個(gè)協(xié)定皆有一個(gè)相鄰表。
Two graphs are isomorphic if there is a correspondence between their vertex sets that preserves adjacency.
如果在兩個(gè)圖之間存在一個(gè)保持鄰接性的1-1對(duì)應(yīng)，則這兩個(gè)圖是同構(gòu)的。
In order to dealing with the clustering considering the condition of planar adjacency relationship, the concept adjacency matrix is defined.
面對(duì)滿足二維空間鄰接條件的聚類問(wèn)題，定義了鄰接矩陣的概念。
There are two major approaches: the adjacency list model, and the modified preorder tree traversal algorithm.
主要有兩種方法：鄰接列表模型，預(yù)排序遍歷樹算法。）汗…這些專業(yè)術(shù)語(yǔ)，翻譯起來(lái)真困難！
The adjacency matrices are symmetric and sparse.
富勒烯分子鄰接矩陣具有對(duì)稱、稀疏的結(jié)構(gòu)。
in this paper , a new algorithm is given to find frequent 2 - item set by adjacency matrix with less times scanning the database.
同時(shí)，提出了一種用鄰接矩陣產(chǎn)生頻繁2項(xiàng)集的方法，可以減少掃描數(shù)據(jù)庫(kù)的次數(shù)。
Conversation structure is the natural structure that language follows, such as turn-taking and adjacency pairs.
會(huì)話結(jié)構(gòu)是自然語(yǔ)言本身固有的的結(jié)構(gòu)，如話輪和相鄰對(duì)；
Each router keeps a list of adjacent neighbors, called the adjacency database.
每顆路由器保有一個(gè)被稱為鄰接資料庫(kù)的相鄰鄰居的表單。
