Thalmann algorithm to achieve the java. Notes detail.

算法设计的分支限界法中的单源最短路径问题的实现，是用VC＋＋编写的-algorithm design of branch and bound method of single source shortest path to the realization of the problem is with VC++ prepared

输入稀疏矩阵中非零的元素，然后建立整个矩阵，实现这两个矩阵相加、相减和相乘运算。 -Enter non-zero elements of sparse matrix, and then build the whole matrix, to achieve these two matrices are added together, subtraction, and multiplication operations.

这个是关于荒岛野人的算法实现，有什么问题请留言-the savage wasteland of the algorithm to achieve and what problems they please leave

一个简单的订单管理系统,用MS SQL,呵呵,下下吧-a simple Order Management System, MS SQL, Oh, where are you

应用背景基于网络的购物网站；特征用户可以添加nrew产品新用户还有更多……关键技术HTML / CSSPHP MySQLAdobe PS图象处理软件

这是为客户提供高效理赔的系统，基于客户端的技术，有良好的效率。

内存数据库控件源代码-memory database source code control

本源码讲述如何把Excel文件转换成mdb数据库。-The source on how to convert Excel files mdb database.

清华大学版数据结构的一下试题资料，望对大家有帮助-Tsinghua University, version data structure questions about the information, hope for all of us help

实现树的创建算法，创建一个至少包含3层，8个结点的二叉树，并对此树实现先中后序的递归遍历算法。输出三种遍历结果。再实现一个叶子结点查找算法，判断一个给定的数值是否在此树中作为叶子结点。-To achieve the creation of the tree algorithm, to create at least a three-layer, 8 nodes of a binary tree, and after this tree in order to achieve the first recursive traversal algorithm. Output the results of three kinds of traversal. And then to achieve a leaf node search algorithm to determine whether a given value in this tree as a leaf node.