1) OAL (Ordered Adjacency List)
有序邻接表
3) OAVL(ordered adjacency vertex list)
有序顶点邻接表
4) adjacency lists
邻接链表
1.
So the storage structure of finite automaton should the choosed adjacency lists.
所以,有穷自动机的存储结构最好采用邻接链表来存储。
5) adjacency list
邻接表
1.
Algorithm of route searching based on adjacency list;
基于邻接表结构的进路搜索算法研究
2.
Algorithm of decompose self-intersection broken line with adjacency list;
基于邻接表分解自相交折线的算法设计
3.
First of all,an adjacency list should be established and its composition chiefly includes orientation,capacity,flux and so on.
首先创建邻接表,其结构包含边的方向、容量、流量等信息。
6) inverse adjacency list
逆邻接表
1.
An algorithm for all vertices-constrained shortest paths is put forward bases on some special data structures,such as inverse adjacency list and uses a minimum spanning tree and the pointer list that marks leaves of the trees.
提出了图中从一个顶点到另一个顶点的求受顶点数限制的所有最短路径的一个算法,算法基于逆邻接表、最短路径生成树和叶子指针链表等几种特殊的数据结构。
2.
A new algorithm based on inverse adjacency list is developed for finding vertices-constrained shortest path.
提出了一种基于逆邻接表求受顶点数限制的最短路径的新算法,其时间复杂度为O((m-2)*w)(m是受限制的顶点数,w是有向图中弧的条数),优于同类算法。
补充资料：阿斯曼通风干湿表(见通风干湿表)
阿斯曼通风干湿表(见通风干湿表)
AS iman tongfeng ganshibiao阿斯曼通风干湿表见通风干湿表。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条