1·The formation and structural features of adjacency list are described.
介绍了邻接表的形成方法和结构特点。
2·The formation and structural features of adjacency list are described.
这台仪器的特点是结构精巧，携带方便。
3·Finally, a particular description of a route searching algorithm is given based on graph data structure of an adjacency list.
详细地论述了基于邻接表图形数据结构的进路搜索算法，并给出了完整的描述。
4·First of all, an adjacency list should be established and its composition chiefly includes orientation, capacity, flux and so on.
首先创建邻接表，其结构包含边的方向、容量、流量等信息。
5·According to the characters of mid-voltage distribution system, the adjacency list of data structure is introduced to save its topology structure.
根据中压配电网的结构特点引入数据结构中邻接表来保存配电网拓扑结构。
6·According to the property of the adjacency list of graphs, the algorithm of Sneak Circuit Search based on adjacency list storage structure is presented.
根据图的邻接表的性质，提出了基于邻接表存储结构的“潜藏通路”搜索算法。
7·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.
首先给出邻接表的构造方法，基于此提出配电网分块快速形成算法。
8·Based on analyzing existed structures of undigraph and characteristics of 2d drawing, Classified Adjacency List which is an improving structure of undigraph is presented.
在充分分析现有无向图存储结构优缺点的基础上，结合二维工程图形的特点，提出了一种改进的无向图存储结构——分类邻接表存储结构。
9·It is discussed how to establish an adjacency linked list, structure the KPN, and how to run the KPN in order to get optimal assembly planning.
文中论述了如何建立邻接链表、构造KPN，以及最后如何运行KPN，获得最佳装配规划。