1) extended adjacency list
扩展邻接表
1.
We also point that the extended adjacency list is .
同时指出在SP Turn方法中 ,扩展邻接表是高效的网络表示形式 ,在合理选择的前提下 ,一般SP算法的标号设定、标号修正等标号技术同样适用 ,最短路径可由节点至弧的形式转换为节点至节点的常规形
2) adjacent multilist
扩展邻接多重表
3) extensive face adjacent graph
扩展型面邻接图
4) Extended Adjacency Matrix
扩展邻接矩阵
1.
A novel approach,Extended Adjacency Matrix representation,to internally represent graph structure is proposed which combines adjacency matrix with adjacency list and orthogonal list allowing for the fastest possible access to different types of information on a directed graph.
在邻接矩阵和邻接表的基础之上,提出了一种新的有向图存储结构-扩展邻接矩阵,并研究了建立该矩阵的算法。
5) expanded link-link relationship matrix
扩展点点邻接矩阵
1.
The analyses used an expanded link-link relationship matrix and an expanded pair-link occurance matrix to store information used to identify the next search direction, which improves th.
该文还提出了扩展点点邻接矩阵与扩展点边关联矩阵的概念,并利用这两个矩阵的扩展列与扩展行存储搜索过程中的信息,为进一步搜索提供了方向,从而提高了机构拓扑回路生成的效率。
6) neighborhood extending
邻域扩展
1.
At the basis of analyzing different boundary tracking algorithms,boundary point estimate algorithm based on angle and boundary point searching algorithm based on circumferential neighborhood extending were advanced to avoid tracking trap and to improve the robust of the boundary tracking algorithm.
通过分析不同算法的特点,提出了基于已知点夹角的边界点预估计算法和基于圆弧邻域扩展的边界点搜索算法,以避免跟踪进入搜索陷阱,提高边界跟踪对边界变化的鲁棒性。
补充资料：阿斯曼通风干湿表(见通风干湿表)
阿斯曼通风干湿表(见通风干湿表)
AS iman tongfeng ganshibiao阿斯曼通风干湿表见通风干湿表。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条