-
chain
链表的模板类,提供插入删除,遍历器,查找等功能,只有一个头文件,可以包含到你的工程(template implemention of Chain)
- 2013-12-09 11:04:33下载
- 积分:1
-
20070320list
包括链表的各项操作,添加、删除、修改等。还包括单项连标和双向链表。(including the operation, add, delete, revise. Also including individual targets and even two-way linked list.)
- 2007-03-20 10:39:42下载
- 积分:1
-
Dijlstra
Dijlstra算法 对任意图,选择合适的数据结构表示图,在此基础上实现求解最短路径的Dijkstra算法(Dijlstra algorithm to arbitrary map, select the appropriate data structures that map, on this basis to achieve solution of the Dijkstra shortest path algorithm)
- 2009-01-11 19:03:11下载
- 积分:1
-
toycon
二查树遍历文件,可以用于程序测试,有喜欢的朋友要多多使用哦(Two check tree traversal file that can be used for program testing)
- 2012-07-17 15:18:23下载
- 积分:1
-
xianxingbiao
另外一个可以实现线性表的程序,简单的操作,值得初学者的借鉴(Another table can achieve a linear process, simple to operate, it is worth drawing beginners)
- 2007-12-07 20:20:32下载
- 积分:1
-
a-linked-list-and-related-processing
链表的建立及相关处理,包括排序,删除,初始化,增加,删除等等,且程序已运行通过。(The establishment of a linked list and related processing, including sorting, delete, initialization, increase, delete, etc., and the program has been run through
)
- 2014-01-13 23:56:27下载
- 积分:1
-
JGMFC
一个MFC编的算法分析课程设计实验“重排九宫源码”(MFC compiled an algorithm analysis course design experiment " rearrangement kau kung source" )
- 2010-03-11 16:13:32下载
- 积分:1
-
pinfanfangwen
设有一头指针为L的带有表头结点的非循环双向链表,其每个结点中除有prev(前驱指针),data(数据)和next(后继指针)域外,还有一个访问频度域freq。在链表被起用前,其值均初始化为零。每当在链表中进行一次Locate(L,x)运算时,令元素值为x的结点中freq域的值增1,并使此链表中结点保持按访问频度非增(递减)的顺序排列,同时最近访问的结点排在频度相同的结点的最后,以便使频繁访问的结点总是靠近表头。试编写符合上述要求的Locate(L,x)运算的算法,该运算为函数过程,返回找到结点的地址,类型为指针型。(Has a head pointer is non-circular doubly linked list L with a header node, each node in addition to prev (precursor pointer), data (data) and next (successor pointers) outside, there is an access frequency degree domain freq. Before the list was hired, their values are initialized to zero. Whenever carried out in the list once Locate (L, x) when the operation, so that the element node x is the value in freq domain by one, and keep this list in the node-access frequency of non-increasing (decreasing) the order, while a recent visit to the nodes in the same row of the frequency of the last node, so that the nodes are frequently accessed tables are always near the head. Locate (L, x) algorithm is prepared in accordance with the above requirements of the test operation, the operation as a function of the process, return to find the address of the node of type pointer.)
- 2015-01-15 22:31:59下载
- 积分:1
-
eightqueen
利用數據結構中的棧,實現19世紀著名數學家高斯提出的八皇后問題(Stack data structure, to achieve the eight queens problem of the 19th century, the famous mathematician Gauss)
- 2012-10-23 08:30:21下载
- 积分:1
-
DataStructAndAlgorithm
数据结构与算法综合资料库,是一本很好的学习计算机的基础教程(Data Structures and Algorithms General database, are a very good tutorial to learn basic computer)
- 2009-03-14 17:56:03下载
- 积分:1