二维及多维链表及其算法实现  

Data structures and algorithm implementation of two-dimension and multi-dimension linked lists

作　　者：李晓东[1] 

机构地区：[1]佛山科学技术学院计算机系,广东佛山528000

出　　处：《佛山科学技术学院学报（自然科学版）》2003年第3期35-38,共4页Journal of Foshan University(Natural Science Edition)

摘　　要：通过对线性链表和数组的比较研究,总结出二(多)维链表的结构和算法,指出采用二(多)维链表可以克服数组内存分配的局限性和单链表数据访问的局限性,并通过实例说明二维链表的用法。By the comparison of general linked lists and arrays,the data structures and algorithm of two-dimension linked lists and multi-dimension linked lists can be gained. It would get over the shortcoming of arrays in memory allocation and the date getting of general linked lists. An example is given to show the usage of two-dimension linked lists.

关 键 词：二维链表 多维链表 数据结构 算法 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]