java数据结构方面的，关于二叉树，很简单、实用

本程序用于数据结构中关于图部分的广度优先搜索和深度优先搜索。-This procedure for the data structure on the map part of the breadth-first search and depth-first search.

改进的矩阵操作类,增加了诸如对矩阵任意行/列的存取,矩阵的积分图像的计算等-improved matrix operations, such as the right to increase the matrix arbitrary line/column access, image matrix of the integral calculation

对核心内的向量机有详细的描述

ACM模拟试题 火星人 附件中有详细的题目要求和运行通过的源代码 -ACM mock examination papers Martian in detail the subject of the annex to the requirements and run through the source code

用C生成一个课程二叉树,同时先、中、后序遍历该二叉树-C programs generated a binary tree, first, during and after the preorder the binary tree

Linux环境下的Sqlite例程，使用函数回调的机制-Linux environment under the Sqlite routines, the use of callback function mechanism

自定义数据类型的堆栈数据结构实现，早些时候学习的时候写的代码了，-Custom data types of the stack data structure to achieve the earlier study, when writing code, and

数据结构的运算方法-data structure computing methods

自己编的一个链表类。我自己经常用来管理内存的释放。还有两个字段用户可以自定义使用。-A calss, used to manage the data

求乘积最大的子序列乘积,采用动态规划方法求解-product for the greatest sequences product using dynamic programming method for