1) Adjacency Edge Management
邻接边管理算法
2) adjacency edge growth algorithm
邻接边增长算法
1.
In this paper,the adjacency edge growth algorithm AEG for determining Hamilton cycle of a simple undirected graph is given,and then the algorithm s mathematical foundation?steps?specification?applied examples.
提出了一个判断给定简单无向图中有无Hamilton圈的邻接边增长算法,给出了该算法的理论基础、算法步骤、算法描述及算法分析。
3) Neighborhood-pixels algorithm
邻接点算法
4) Four neighborhood pixels algorithm
四邻接点算法
5) adjacency matrix algorithm
邻接矩阵算法
1.
Study on speedup computation techniques of adjacency matrix algorithm for station and substation reliability evaluation;
文中对邻接矩阵算法的加速计算技术进行了深入研究。
6) The algorithm of adjacent nodes
邻接结点算法
补充资料：邻接
1.邻近，接近。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条