资源列表
shuleiyuandaima(quan)
- 用vc++编写的关于数据结构的树类的算法，完全可用，很全面-vc used to prepare data on the structure of the Tree Algorithm and it is perfectly possible, very comprehensive
AVLdelete
- AVL树，对其进行结点的删除操作算法的程序-AVL tree, its nodes of the deletion algorithm procedures
lifegame_cpp
- 用程序模拟生命演化游戏，屏幕上输出各步演化结果-procedures in the evolution of life simulation games, screen output results of the further evolution
FEM_main
- 一阶有限元通用程序，边界条件可变,可以用于机械应力分析，电磁场数值计算等领域。而且可以自编自东剖份程序作为入口。-a finite element analysis program, boundary conditions variable, which can be used mechanical stress analysis, Numerical Calculation of electromagnetic fields. Can be directed and performed in
1051WoodenSticks
- acm HDOJ 1051WoodenSticks Descr iption: There is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It needs some time, called setup
1050MovingTtables
- HDOJ ACM input:The input consists of T test cases. The number of test cases ) (T is given in the first line of the input. Each test case begins with a line containing an integer N , 1<=N<=200 , that represents the number of tables to move. Ea
1047IntegerInquiry
- HDOJ 1047 One of the first users of BIT s new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 and he explored taking various sums of those numbers. ``This supercomputer is great, remarked Chip. ``I o
listDatastructure
- 编写程序，实现有序链表的建立；并实现对两个有序链表的归并操作，主要实验内容如下： 1. 定义链表的数据类型（带有头结点）； 2. 实现链表的基本操作：初始化、销毁、有序插入； 3. 通过键盘输入建立一个非递减有序链表（键盘输入不一定按照非递减的顺序） 4. 对通过键盘输入而建立好的两个非递减有序链表进行归并操作，并将归并好的有序链表输出。（需要编写一个归并函数）-preparation procedures, the establishment of an orderly cha
Demo01-TowersofHanoi
- 以图形界面的方式形象的描述了数据结构中翰诺塔的过程-graphical interface to the image descr iption of the data structure Brigham Young Tower of the process
SortTree
- 创建一棵二叉排序树，并采用中序遍历和层次遍历法输出其顶点序列，主要实验内容如下： 1. 定义二叉排序树的结构BiTree； 2. 编制二叉排序树的插入算法：void Insert_SortTree (BiTree ST, ElemType x)； 3. 编制中序遍历函数； 4. 在main()函数中完成二叉排序树的建立，以及中序遍历的输出。（二叉排序树的各个元素从键盘输入，并利用Insert_SortTree()函数进行插入建立）； 5. 编制层次遍历函数，并在main()函
C_linksort
- C＋＋的链表排序算法，简单清晰，移植扩充均非常方便。-C + + objectlist sorting algorithm, simple and clear, expansion of transplantation are very convenient.
DIJSHOW
- 迪杰斯特拉算法求最短路径，图形化界面，visual c++ -Dijieshitela algorithms for the shortest path, graphics interface, visual c