Adjacency(英語單詞)

Adjacency，英語單詞，主要用作名詞，主要意思為“毗鄰；四周；鄰接物”等。

基本介紹

• 外文名：Adjacency
• 詞性：名詞
• 英式音標：[əˈdʒeɪsənsi]
• 美式音標：[əˈdʒeɪsənsi]

單詞釋義

英 [əˈdʒeɪsənsi] 美 [əˈdʒeɪsənsi]

n. 毗鄰；四周；鄰接物

[ 複數 adjacencies ]

短語搭配

adjacency matrix [數] 鄰接矩陣 ; 鄰近矩陣

adjacency list 鄰接表 ; 相鄰列 ; 鄰接列表 ; 相鄰串列

adjacency matrix method 鄰接矩陣表示法 ; 鄰人矩陣暗示法 ; 毗鄰矩陣暗示法

adjacency multilist 鄰接多重表 ; 相鄰多元串列

adjacency list method 鄰接表表示法 ; 毗鄰表暗示法 ; 鄰人表暗示法

Adjacency Table 鄰接表

adjacency list model 毗鄰目錄模式 ; 鄰接表模式 ; 鄰接列表模型 ; 鄰接表模型

adjacency effects 鄰界效應

Adjacency lists 鄰接表 ; 鄰接矩陣 ; 鄰接列表

雙語例句

• The edges for this step can be found in the adjacency matrix. 此步驟的邊可以在鄰接矩陣中找到。
• How to read this graph input and put into an adjacency matrix? 如何把這個圖形輸入和投入一個鄰接矩陣？
• There is the relationship between the graph and the adjacency matrix. 圖與其鄰接矩陣之間有著一一對應的關係。
• The formation and structural features of adjacency list are described. 介紹了鄰接表的形成方法和結構特點。
• Adjacency pair is a basic unit of the conversation structure which is more complex. 相鄰對是會話結構的一種基本單位。
• First, the algorithm mines the data for frequent sequences and computes an adjacency lattice. 首先，該算法挖掘頻繁序列的數據並計算一個鄰接格。
• According to the marker image, the image is stored in the form of region adjacency graph. 根據標記圖像，將圖像以區域鄰接圖的方式進行存儲。
• Three methods of computing accessibility matrix from adjacency matrix are introduced in this paper. 介紹了由鄰接矩陣求可達性矩陣的三個方法。
• The other had character of organization adjacency, which was also considered Virtual Industry Clusters. 二是以“組織接近”為特徵的產業集群，又稱為虛擬產業集群。
• With the results of the algorithms, side adjacency direction matrix for boundary quadrants can be defined. 利用這些算法的執行結果，可以定義一個邊界四分形的邊鄰接方向矩陣。
• The basic relation matrix is automatically generated finally through data transform by using the adjacency matrix. 通過數據轉化，利用鄰接矩陣生成管網基本關係矩陣。
• In color development a complicated relationship between the adjacency effects of silver and dye images was observed. 在彩色顯影中銀影像和染料影像的鄰界效應的關係呈顯出複雜的情況。
• Scanned engineering drawings are self- organizationally recognized based on Primitive Region Adjacency Graph (PRAG). 本文提出基於單義域鄰接圖的掃描工程圖樣自組織智慧型識別。
• These operations typically require the inspection of surface adjacency pairs of octants in three principal directions. 這些操作典型地需要檢查線性八元樹中諸八分體在三個主方向上的面鄰接對。
• And the key nodes and the adjacency between nodes can be reflected by the adjacent matrix of the master network graph. 主網路圖的鄰接矩陣反映了各節點間的鄰接關係和關鍵節點。
• The shape, location, origin and insertion, course and adjacency relationships of the individual structures were described. 描述了上述結構的形態、位置、起止點、走行和毗鄰關係。
• Finally, a particular description of a route searching algorithm is given based on graph data structure of an adjacency list. 詳細地論述了基於鄰接表圖形數據結構的進路搜尋算法，並給出了完整的描述。
• First of all, an adjacency list should be established and its composition chiefly includes orientation, capacity, flux and so on. 首先創建鄰接表，其結構包含邊的方向、容量、流量等信息。
• Fault Diagnosis is based on the event correlation, graph theory and adjacency matrix are two methods to get the root failure sets. 故障關聯算法依據故障之間的關聯關係，運用圖論和鄰接矩陣的方法求出根故障集。
• In this thesis, we investigate the application of graph spectra on the energy and the properties of the adjacency matrix of graphs. 本文我們研究譜圖理論在圖的能量及圖的鄰接矩陣的性質方面的套用。
• There are go-return route and out-in routes in bus route, use the method of better adjacency matrix to implement this kind of bus change. 針對公交線路中存在往返路線不一致、內外線路等情況，對用改進的鄰接矩陣方法實現這一類型的公交換乘進行了研究。
• In addition, the relationship of organization view and resources view in IPT group with other models is represented by adjacency matrices. 另外通過用鄰接矩陣表示IPT小組的組織視圖和資源視圖與其它模型的關係。
• A new method of obtaining linkage characteristic polynomials based on the adjacency matrix of the kinetic chain is presented in the paper. 本文介紹了一種建立在運動鏈關聯矩陣基礎上求解運動鏈特性多項式的新方法。
• In order to dealing with the clustering considering the condition of planar adjacency relationship, the concept adjacency matrix is defined. 面對滿足二維空間鄰接條件的聚類問題，定義了鄰接矩陣的概念。
• Through the adjacency matrix, computing networks, clustering coefficient. Clustering coefficient is a complex network, an important parameter. 通過鄰接矩陣，計算網路的聚類係數。聚類係數是複雜網路中一個重要參量。
• 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. 有向圖的鄰接矩陣比較容易建立，但是在建立結構模型時，更有用的是要素間的可達關係。
• According to the characters of mid-voltage distribution system, the adjacency list of data structure is introduced to save its topology structure. 根據中壓配電網的結構特點引入數據結構中鄰接表來保存配電網拓撲結構。
• According this, the method that can reproduce the topology structure of the object network by using figure theory and adjacency matrix was discussed. 據此，提出用圖論和矩陣重現目標網路拓撲結構的鄰接矩陣法。
• According to the property of the adjacency list of graphs, the algorithm of Sneak Circuit Search based on adjacency list storage structure is presented. 根據圖的鄰接表的性質，提出了基於鄰接表存儲結構的“潛藏通路”搜尋算法。