adjacency list
基本解釋
- 鄰接表
英漢例句
- Finally, a particular description of a route searching algorithm is given based on graph data structure of an adjacency list.
詳細(xì)地論述了基于鄰接表圖形數(shù)據(jù)結(jié)構(gòu)的進(jìn)路搜索算法,并給出了完整的描述。 - According to the characters of mid-voltage distribution system, the adjacency list of data structure is introduced to save its topology structure.
根據(jù)中壓配電網(wǎng)的結(jié)構(gòu)特點(diǎn)引入數(shù)據(jù)結(jié)構(gòu)中鄰接表來保存配電網(wǎng)拓?fù)浣Y(jié)構(gòu)。 - First, the constructional method of adjacency list is given; then on this basis a fast forming algorithm of sections in distribution network is put forward.
首先給出鄰接表的構(gòu)造方法,基于此提出配電網(wǎng)分塊快速形成算法。
www.dwjs.com.cn
雙語例句
詞組短語
- adjacency -list representation 相鄰列表表示法
- adjacency y list method 鄰接表表示法
- adjacency linked list 鄰接鏈表
- adjacency list method 鄰接表表示法;毗鄰表暗示法;鄰人表暗示法
- adjacency list model 毗鄰目錄模式;鄰接表模式;鄰接列表模型;鄰接表模型
短語
專業(yè)釋義
- 鄰接表
It also optimizes the algorithm by applying Adjacency List as the data storage structure after analysing the algorithm.
通過對Dijkstra算法數(shù)據(jù)存儲結(jié)構(gòu)進(jìn)行分析,選擇鄰接表作為網(wǎng)格點(diǎn)的存儲結(jié)構(gòu),有效的避免了權(quán)值為無窮大的無效點(diǎn),降低了算法的空間復(fù)雜度。 - 相鄰列
- 相鄰串列