资源列表
excise 2
- 汽车动力学仿真（对比法拉力和奔驰的悬驾系统，）-vehicle dynamics simulation (compared to the Ferrari and Mercedes Overhanging drive system)
重发尾插法建立单链表及其遍历
- 用尾插法建立单链表，可以事先不必指定要插入的元素的个数，比较灵活，注意输入数据时以－1结束-tailings interpolation creation of a single-chain and can not designated prior to the insertion of items, a more flexible, pay attention to the input data to the end-1
重发求树高的程序
- 用递归的方法求二叉树的树高，使用时更加灵活，注意输入的数据以－1结束-using recursive method for binary tree height, use a more flexible, pay attention to input data to the end-1
（－1结束）求树高
- 用递归的方法的方法求二叉树的树高，注意输入的节点数据以－1结束。-use recursive methods for the binary tree height, pay attention to input data to the nodes -1 end.
递归中序遍历排序二叉树
- 这是一个中序遍历二叉树的VC实现，要注意的是输入节点后，以－1结束-which is a binary tree traversal sequence VC, to pay attention to the input nodes, in the end -1
二叉排序二叉树的建立
- 二叉排序树的建立是数据结构中许多二叉树算法实现的基础，本程序输入节点时，以－1表示输入结束-two forks of the tree data structure is the establishment of many of the binary tree algorithm based on the input node procedure, said the importation of 1 to the end
链栈的建立及出入栈
- 用链表结构完成堆栈的任务，使用时更加灵活方便-structure with the mandate to complete stack, use more flexible and convenient
支持向量机的SMO算法VC实现
- 支持向量机的SMO算法VC实现,在模式识别和 许多方面很有用-support vector machine algorithm VC SMO, in pattern recognition and useful in many ways
字模提取软件
- 一种点阵字模提取小程序。可以生成字符、数字的多种点阵数组，便于特征提取。-a small lattice Abstraction procedures. Characters can be generated, the number of multiple lattice array facilitate feature extraction.
src-conv.tar
- 蒙特卡罗算法。用盟特卡罗算法模拟光在组织钟的传播，也可以模拟其它领域随机粒子的运动等。-Monte Carlo algorithm. Shakespeare used the AU-simulation algorithm organizations bell in the spread, but also in other fields can be simulated random particle movement.
fastjar-0.90
- jar文件处理原程序，实现类似于jdk中jar命令的类似功能，可以生成，读取，解压jar文件，支持manifest-jar document processing program, which jdk achieve similar orders of the jar similar functions, can be generated, read, extract jar papers to support manifest
forward
- 该程序用于地球物理电测深的正演模拟，用C＋＋编写，在VC++下编译通过。-the procedures for geophysical sounding the forward modeling, C + +, VC compile.