包含图的遍历和线性链表两个内容，压缩文件里含有设计报告...

一个简易的ACCESS的源程序 VB源码-数据库-ACCESS a simple VB source code- database

适合Java初级学者的滴滴打车系统选择出发地址和目的地，会寻找最短路径，进行最低消费。根据走的路径的距离来判断收费的情况，可以随时更新出租车司机的基本信息，以及车辆的维修情况

数据结构 详细描述了如何创建二叉树的方法以及操作-Data structure described in detail how to create a binary tree method and the operation of

哈夫曼树算法 根据给定的n个权值{w1,w2,……wn}，构造n棵只有根结点的二叉树，令起权值为wj 在森林中选取两棵根结点权值最小的树作左右子树，构造一棵新的二叉树，置新二叉树根结点权值为其左右子树根结点权值之和 在森林中删除这两棵树，同时将新得到的二叉树加入森林中 重复上述两步，直到只含一棵树为止，这棵树即哈夫曼树 -Huffman tree algorithm based on a given n-weights (w1, w2, ... ... wn), construct n trees only a root node of the tree, so that from the right value of wj in the forest root node to select two the right tree for the value of the smallest subtree around, a new binary tree structure, the right to buy a new tree root node value of its subtree root node around the right value in the forest and delete these two trees, At the same time, the new binary tree obtained by adding the forest to repeat the above two steps until a tree containing only the date, that is, Huffman tree tree

利用Fortran 90 接口读取已经创建的nc文件，并且检验其读写是否正确-The use of Fortran 90 interface to read nc file has been created, and test its read and write correctly

基于决策树和贝叶斯的预测分析器，可以对数据库中的数据集通过训练学习后根据训练结果进行信息预测。-Based on Decision Tree and Bayesian prediction of the analyzer can be in the database data sets through training to learn the results after the training information in accordance with prediction.

双端堆是支持双端优先队列的插入、删除最小元素和最大元素等操作的堆。 双端堆可以在对数时间内完成上述所有的操作。 -Double-ended heap to support double-ended priority queue insert, delete the smallest element and the largest such operation of the reactor element. Double-ended heap in logarithmic time to complete all of the above operation.

病人管理系统是用来保持病人预约和病史。

数据结构中栈的经典算法――第一类背包问题，已经通过测试！-The stack data structure in the classic method- The first knapsack problem, has passed the test!

一个采用VC+ACCESS开发的酒店管理，以及论文-using a development of the VC ACCESS hotel management, and the papers