资源列表
先序线索化以及遍历
- 该程序提供对需要进行遍历的树的自定义输入，并可以在对树进行先序线索化之后遍历该树。-the procedures needed to traverse the tree from the definition of import, and to be right tree for first sequence of clues after traversal of the tree.
（1）
- 1、 用随机数生成的方式（要求用户输入随机数）产生一个迷宫：“1”表示墙，“0”表示路，最后的路径用“8”表示，若没有路径则打印报文，若有路径则打印出路径。 2、 通过堆栈及判断实现迷宫的自动寻找路径功能 -1, the random number generator of (requiring user input random number) produces a maze : "a" Wall said, "0" Lu said, the f
hilbert
- 这个是Hilbert曲线的实现算法,可以具体演示出每级曲线的绘制过程,最多可实现8级曲线的绘制.-Hilbert Curve is the realization of the algorithm can be demonstrated that each specific grade curve of the process of drawing up to achieve eight curve drawing.
FFT_C++
- 用C++实现的快速傅立叶变换（FFT）的结构算法，其功用就不用细说了吧-C realized Fast Fourier Transform (FFT) algorithm structure, its purpose would not have to elaborate on it
BoolCheck
- 一个计算逻辑表达式的程序，是结构化计算机组成课实习的作业-a logical expression calculation procedures, the structure is composed of computer training classes operations
高精度数加减乘法
- 高精度数的加减乘法，可以自定义进制，作为类实现，直接使用即可。-precision the number of addition and subtraction multiplication can be defined band, as the category achieved, can be used directly.
xianlu
- 一个关于供求陪送的线路程序。里面用到了最短路径的知识，给初学者参考-one of the lines of supply and demand escort procedures. They use the shortest path of knowledge, reference to beginners
怎样判断一个指针指向的对象是否已经被析构
- 怎样判断一个指针指向的对象是否已经被析构，很好的学习C++的资料-how to decide a pointer at whether the target has been Destructors, good learning C information
HORSEJUMPCHESS
- 马跳棋盘递归算法(TC实现,并提供示意图),可移植到任何C编译器-Ma checkerboard recursive algorithm (TC achieved, and to provide diagram), and can be transplanted to any C compiler
OTHELLOCHESS
- 黑白棋(othello)示例算法,TC实现,提供交互界面功能-reversi (othello) algorithm for example, TC achieved, providing interface function
WUZICHESS
- 五子棋(TC版),提供交互界面,TC2.0编译-331 (TC edition), provides interfaces to compile WITH TC 2.0
zenglListNode
- 简单的链表数据结构算法。简单的链表数据结构算法程序，-simple algorithm data structure. Listless simple data structure algorithms procedures,