1) radix-K circular linklist
K基数循环链表
2) cycle linked list
循环链表
1.
This article presents how to solve Josephus problem by cycle linked list and heap memory method in c++, and expounds the superiority of this method to that of the array.
利用C++中的堆内存原理,采用循环链表方法很好地解决了约瑟芬问题,并阐述了此方法与数组方法相比的优越性。
3) dual-circulation linked list
双循环链表
1.
With respect to triangle meshes, this paper proposes a symmetry edge dual-circulation linked list structure.
针对三角格网提出一种对称边双循环链表结构,对称边是指一条边由2个有向边表示,双循环链表是指这些线段分别以其2个端点为源点,通过同源点关系使线段之间能够顺时针与逆时针方向关联。
2.
As to representation of triangulated irregular network(TIN),a dual-circulation linked list structure is proposed,this structure can conveniently express edge and plane topology information of triangulated irregular network,and polygon structure.
对于三角网的表示方法,提出了一种双循环链表结构,这种结构能够方便的表示三角网的边拓扑和面拓扑信息,以及多边形结构。
4) circular linked list
单循环链表
5) similar cycle link Table
类循环链表
6) circularly linked list
循环链接表
补充资料：基数标准(见基数)
基数标准(见基数)
level of basic load
lishu biaozhun基数标准(level of basic load)见基数。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条