介绍了邻接表的形成方法和结构特点。
The formation and structural features of adjacency list are described.
首先创建邻接表，其结构包含边的方向、容量、流量等信息。
First of all, an adjacency list should be established and its composition chiefly includes orientation, capacity, flux and so on.
首先给出邻接表的构造方法，基于此提出配电网分块快速形成算法。
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.
根据中压配电网的结构特点引入数据结构中邻接表来保存配电网拓扑结构。
According to the characters of mid-voltage distribution system, the adjacency list of data structure is introduced to save its topology structure.
详细地论述了基于邻接表图形数据结构的进路搜索算法，并给出了完整的描述。
Finally, a particular description of a route searching algorithm is given based on graph data structure of an adjacency list.
根据图的邻接表的性质，提出了基于邻接表存储结构的“潜藏通路”搜索算法。
According to the property of the adjacency list of graphs, the algorithm of Sneak Circuit Search based on adjacency list storage structure is presented.
在对邻接表整合后，将相邻标记的特征信息合并，从而获得视场中各目标的特征。
After conformed the adjoining label table, the feature information of adjoining label is merged to get the target features.
在邻接矩阵和邻接表的基础之上，提出了一种新的有向图存储结构-扩展邻接矩阵，并研究了建立该矩阵的算法。
This paper presents a minimal cut set method based on the adjacent terminal matrix, which can be used to evaluate the reliability of main electric connection schemes for the railway station-oriented.
针对该文的算法提出了一种基于节点邻接表的搜索方法，用于搜索环网、形成环网阻抗矩阵而无需进行复杂的编码。
Moreover, a searching method based on the adjacent nodes table is presented to search the loops and obtain its impedance matrix.
在充分分析现有无向图存储结构优缺点的基础上，结合二维工程图形的特点，提出了一种改进的无向图存储结构——分类邻接表存储结构。
Based on analyzing existed structures of undigraph and characteristics of 2d drawing, Classified Adjacency List which is an improving structure of undigraph is presented.
当DB 2中的数据物理上邻接(即表空间的连续页)时，很可能在SSD上是连续的单元。
When data appears to be physically adjacent in DB2 (that is, consecutive pages in the table space), it is very unlikely to be in consecutive cells on the SSD.
每一个面都使用了一个生成面的操作ID，一个操作内部分配的ID和一个邻接面表进行命名。
The name of a face is consisted of an operator ID, an inner ID and an array of references of its neighbor faces.
利用后滤波的原理，对多邻接点时新边界点的选择和轮廓端点的对称合成等问题进行了分析，采用构造拟合曲线查找表进行曲线拟合的方法实现反走样。
By use of the theory of after filter, the problems of selecting new boundary point when several points border upon each other and symmetrical combination for outline points are analyzed.
利用后滤波的原理，对多邻接点时新边界点的选择和轮廓端点的对称合成等问题进行了分析，采用构造拟合曲线查找表进行曲线拟合的方法实现反走样。
By use of the theory of after filter, the problems of selecting new boundary point when several points border upon each other and symmetrical combination for outline points are analyzed.
应用推荐