-
nuaa1507_DancingLink_trackback.cpp
高德纳发明的高效数据结构dancing link,这里是解重复覆盖问题的一个演示(Donald Knuth invented efficient data structure dancing link, here is the solution to repeat coverage of a demonstration)
- 2010-03-07 10:54:32下载
- 积分:1
-
太阳能电池参数计算器 升级版
太阳能电池参数计算,可以快速方便计算电流,电压,填充因子等参数(Solar cell parameter calculation)
- 2017-11-23 21:30:46下载
- 积分:1
-
Devillanguage1
Devil language
数据结构中的经典问题
此为问题!(Devil language data structure of the classic problems of this problem!)
- 2006-10-17 23:42:17下载
- 积分:1
-
BSM
一个很经典的问题_八数码!
算法速度快,解决问题多...有兴趣的可以(A very classic problem _ eight digital! Fast algorithm to solve the problem ... are interested in more than can be)
- 2008-05-04 13:42:30下载
- 积分:1
-
huffman_tree
数据结构学习中提供的不错的源码,一个哈夫曼树类,利用了链队列存储结构。压缩包中有七个文件。(Data structure provided a good learning source, a Huffman tree class, the use of the chain queue storage structure. There are seven compressed file.)
- 2013-12-28 15:21:48下载
- 积分:1
-
findpt
VC游戏编写中的求解最短路径算法源码,本示例是自动寻径演示,篮点是起点,红点是终点,按确定键开始。源码爱好者注:编译后运行的时候请把EXE文件从Debug目录中拷贝到项目根目录中,若不然会出错。 (The preparation of the VC games to solve the shortest path algorithm source code, in this example is the automatic routing demonstration, the basket is the starting point, the red dot is the end point, press the OK button to start. Source enthusiasts Note: When compiled and run, please copy the EXE file from the Debug directory to the root directory of the project, and if not be wrong.)
- 2013-05-17 15:38:23下载
- 积分:1
-
bubblesort
这个是关于数据结构中冒泡排序算法的实现,大家可以利用这个为基础,进一步研究和利用排序(This is a data structure on the Bubble Sort algorithm, we can use this as a basis for further study and use of sorting)
- 2009-01-14 23:37:37下载
- 积分:1
-
listnode
C++中,对链表的增删改查的基本使用,值得学习(C++, on the list of CRUD basic use, it is worth learning)
- 2015-08-05 17:57:12下载
- 积分:1
-
LINK
建立链表的算法:
新节点链入表尾建立链表:
动态分配第一个节点变量;
用指针head 妥善保存链表第一个节点的地址值;
依次动态分配一个新节点变量;
将上一个节点的指针域指向新生成的节点;
循环3),4)步骤,直到所有节点均连入链表;
将最后一个节点的指针域赋值为0;
(Establish the list of algorithms:
The new node links footer build list:
Dynamic allocation of the first node variable
Keep the list head pointer of the first node address value
In order to dynamically allocate a new node variable
The domain of a node pointer to the new generation of nodes
Cycle 3), 4) step, until all nodes are connected to the chain
Pointer field will last node assigned to 0 )
- 2015-01-05 16:03:48下载
- 积分:1
-
Graph
数据结构中图的遍历Data structure traversal of center(Data structure traversal of center)
- 2013-11-28 10:53:29下载
- 积分:1