用VB与ACCESS数据库结合编写的远程数据传输程序

是比较好的SVM 代码，对一些初学者而言，可以好好利用，可能开始自己编写代码会比较困难，但是多看看别人写的代码 ，可能会对自己有所帮助，所以上传此代码，为了让更多人好好利用资源，好好学习

十字链表，可实现插入，删除，保存，恢复等功能-Cross linked lists, can be insert, delete, save and restore functions

该代码可以解决职工的信息管理和工资、奖金的管理系统，同时该管理系统具有很好的数据承载能力，后期的维护工作可能稍微要轻松点的。。。

利用TreeCtr控件访问数据库-use TreeCtr controls access to the database

pc游戏编程_人机博弈,算法和实现都比较完整，源码可运行。且可以从中学到很好的算法知识，和人机博弈-pc game programming _ man-machine game, algorithms and realization are relatively complete, source code can run. And can learn a good knowledge of algorithms, and human-computer game

代码名称：资料管理系统 一个资料管理系统的源程序，VB+ACCESS2000+ADO，功能强大-code name : an information management system information management system of the source, VB ACCESS2000 ADO, powerful

一个最短路径算法，具体内容程序开头有介绍-a shortest path algorithm, the specific content of the beginning of a process introduced

数据结构中最经常用到的，包括链表、双链表、二叉树、平衡二叉树、哈希表等-Data structure the most frequently used, including the list, double linked lists, binary tree, balanced binary tree, hash table, etc.

哈夫曼树算法 根据给定的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

这是用java实现的一个仓储管理系统，数据库部分有一定参考价值，包含整套设计方案和项目报告书。-Java This is achieved using a warehouse management system, part of the database have a certain reference value, including the entire design and project report.