邻接表

基于邻接表结构的进路搜索算法研究

Algorithm of route searching based on adjacency list

在这之前查到的文献都是基于图结构的存储方式，如邻接表等。

Before this , almost documents are based on graph , such as adjacency list .

基于四叉堆优先级队列及逆邻接表的改进型Dijkstra算法

Improved Dijkstra Algorithm Based on Quad Heap Priority Queue and Inverse Adjacent List

在IA算法中引入事务的长度这个新概念，使用邻接表存储事务数据库。

IA algorithm is introduced in " The length transaction " is a new concept and the use of adjacency table to store transaction database .

通过对STL文件的分析和几种常用数据结构的比较，给出了一种层次环状数据结构，该结构是由快速排序顶点序列进行冗余顶点滤除，并建立顶点邻接表和三角面片邻接表而得到的。

A hierarchy and circularity of data structure was presented by analyzed STL files and compared a several of frequently used data structures . The structure acquired from redundancy vertex was filtered by vertex sequence of quick sort , and vertex adjacent list and triangle face adjacent list was established .

另外，还提出了一种基于节点邻接表的节点编号方法。

Moreover , a bus-labeling method based on the adjacent nodes table is presented .

同时，该方法利用节点–支路邻接表，加快了拓扑速度。

Moreover , using the adjacency list of node-branch in this method , the topology is accelerated .

采用逆邻接表作为图的存储结构，该算法很容易实现。

Because of the inverse adjacency list structure , this algorithm is much simple and easy to be fulfilled .

一些邻接表表示，提出初步分析，以及一些有希望的实验结果。

Some preliminary analysis of the Adjacency List representation is presented , as well as some promising experimental results .

给出了用邻接表保存配电网拓扑结构的实现程序以及运行方式改变后进行拓扑结构再分析的方法。

The implementation program is provided , and the reanalysis method of topology structure after operation pattern change is offered .

该算法引入了数据结构中的深度优先搜索、广度优先搜索以及邻接表的概念。

This algorithm introduces the conceptions of Depth__ First Search , Breadth__ First Search and Adjacency List in data structure .

在对邻接表整合后，将相邻标记的特征信息合并，从而获得视场中各目标的特征。

After conformed the adjoining label table , the feature information of adjoining label is merged to get the target features .

根据中压配电网的结构特点引入数据结构中邻接表来保存配电网拓扑结构。

According to the characters of mid-voltage distribution system , the adjacency list of data structure is introduced to save its topology structure .

用基于邻接表的前推后代潮流算法校验供电恢复路径是否可行。

The back / forward sweep distribution power flow algorithm based on adjacency list is used to checkout the feasibility of the restore path .

首先创建邻接表，其结构包含边的方向、容量、流量等信息。

First of all , an adjacency list should be established and its composition chiefly includes orientation , capacity , flux and so on .

在充分分析现有无向图存储结构优缺点的基础上，结合二维工程图形的特点，提出了一种改进的无向图存储结构&分类邻接表存储结构。

Based on analyzing existed structures of undigraph and characteristics of2D drawing , Classified Adjacency List which is an improving structure of undigraph is presented .

根据图的邻接表的性质，提出了基于邻接表存储结构的潜藏通路搜索算法。

According to the property of the adjacency list of graphs , the algorithm of Sneak Circuit Search based on adjacency list storage structure is presented .

为提取图像区域间的关系，提出了一种区域内外边界跟踪的方法，并给出相应的算法，同时建立了混合图的邻接表存储结构。

The paper also presents an algorithm of discovering the relations between regions by boundary tracking . Adjacency List is used as storage structure of mixed graph .

首先给出邻接表的构造方法，基于此提出配电网分块快速形成算法。

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 .

为了解决节点交叉受限的约束，文中扩展了常用的邻接表存储结构，扩展的邻接表存储结构使节点端口的信息能够完全地被反映出来。

For the purpose of removing crossing nodes limitations , this paper extends the common-used adjacency list storage contracture , which can then reveal the information of nodes port completely .

由于任务之间存在优先约束，编码得到的个体可能不满足该约束，所以本文选用逆邻接表进行调整。

It has precedence constraints between the tasks . The individual by encoded may not satisfy the constraint , so this paper adjusts the result by a reverse adjacency list .

该模型用方案树与邻接表描述动态路网的拓扑结构，用数据库存储路网数据，达到了尽可能减少数据冗余度并有效揭示动态性的目的。

The topology was represented with scheme-tree and adjacency list in the new model with dada saved in the database , so that data redundancy had greatly reduced and evolution was depict distinctly .

结果表明，建立流域概化图是研究问题的基础，邻接表逻辑结构定义影响计算机搜索的速度，采用合理的程序组件有利于计算机实现。

It indicated that valley conception model was study foundation , logical structure definition of node joining table effected search speed , and the computer realization was achieved more easily by rational programming components .

针对目前电网拓扑结构大多采用人工分析、手工输入的局面，提出了应用扩展的邻接表表示法来存储网络图形的方法。

This paper is aimed at the status that the conventional electrical topology graph was analyzed and input to computer artificially and brings forward a method using extended adjoining table to store the graphs .

在有向拓扑结构图的建立过程中，把节点和支路制成图形控件，采用热点自动连接和稀疏向量技术建立节点和支路的邻接表，使有向拓扑结构搜索方便而快捷。

In the process of building directed topology graphics , the nodes and branches are made into graphics controls , Sparse network vectors and hotspot automation connection technology are employed to construct adjacency list .

讨论了网络计划生成中，父子关系数据结构、串并行关系数据结构、网络计划的邻接表、任务扩展步骤，以及生成网络计划的递归算法。

The data hierarchy with parent-child relation , the data structure with serial relation , adjacency list of network schedule , the process of extended task , and recursive algorithm for creating network schedule is discussed .

在目标标记过程中，使用尽量少的标记号标识二值像，同时统计各个标记的面积、灰度以及其他特征信息，并将相邻标记写入邻接表。

The binary image is labelled with less label number , and the area , grey and other features of each label are accounted , and the adjoining label is written into adjoining label ( AL ) table .

提出了一种不依赖于背景网格的新型阵面推进法，采用结构数组与邻接表相结合的数据结构，大大提高了查找、删除操作效率。

A new advancing-front method which is independent of the background is introduced . A new data structure which combines structured array and adjacency list is applied in this method to increase the efficiency of search and deletion greatly .

然后对比图的存储结构，设计了基于邻接表的楼宇三维路径模型存储方法，并且给出了部分存储数据结构。（3）楼宇三维路径规划与设计。

Then by comparing the storage structures of graph , the storage method of this model is designed based on adjacent table , and parts of the data structure are given . ( 3 ) Studying path planning methods .

算法实现采用邻接表数据结构和限制搜索区域的搜索机制，即利用实际城市道路网络的空间分布特性，合理限制算法的搜索区域。

The algorithm takes advantage of the adjacent list data structure and the mechanism of restricted searching area , that is , the algorithm uses the spatial distribution feature of the real road network to restrict the searching area reasonably .