直接通过ADO操作Access数据库

求单源点最短路径算法，对一个途中各个节点和权值的设置，找出从起始点倒终结点的一条最短路径，不能够输出路径

这是用数据库语言编写的仓库管理系统-This is the database used to prepare the language Warehouse Management System

数据库实现员工的管理-database management staff

日本ATR（Advanced Telecommunication Research InstituteInternational）的专门用于表情识别研究的基本表情数据库JAFFE，该数据库中包含了213幅（每幅图像的分辨率：256像素×256像素）日本女性的脸相，每幅图像都有原始的表情定义。表情库中共有10个人，每个人有7种表情（中性脸、高兴、悲伤、惊奇、愤怒、厌恶、恐惧）。 JAFFE数据库均为正面脸相，且把原始图像进行重新调整和修剪，使得眼睛在数据库图像中的位置大致相同，脸部尺寸基本一致，光照均为正面光源，但光照强度有差异。由于此表情数据库完全开放，且表情标定很标准，所以现在大多数研究表情识别的文章中都使用它来训练与测试。-Japan ATR (Advanced Telecommunication Research InstituteInternational), devoted to the basic expression of facial expression recognition research database JAFFE, the database contains 213 (each image resolution: 256 pixels × 256 pixels) Japanese women face relative to each piece of expression of both the original definition of the image. Expression library, a total of 10 individuals, each person has seven kinds of expressions (neutral face, happy, sad, surprise, anger, disgust, fear). JAFFE face database are positive phase, and the original image is re-adjust and trim, making the eye the location of the image in the database similar to the face basically the same size, ligh

二叉树的建立与遍历 可实现： （1）树的创建采用先序方式，用特殊符号0表示左、右子树为空 （2）每次输入一个节点的值，可以根据自己的需要设计不同的节点结构 （3）节点的值为非零数 （4）可以（）形式输出创建的树 （5）用先序后序和中序遍历树 （6）销毁树 -Establishment and tree traversal can be achieved: (1) tree created using the first order approach, with special symbols 0 express the left and right subtree is empty (2) for each input the value of a node, you can according to their own needs Design of different node structure (3) non-zero value of the node number (4) can () to create the form of the output tree (5) after the first sequence and the sequence of traversal tree (6) the destruction of trees

伸展树……我写的很难看，而且又很长，这个结构唯一有用的就是可以分离树- Extends the tree... ... I write very ugly, moreover very long, this structure only is useful is may separate the tree

数据结构的一些简单编程题,二叉树结构，遍历的递归于非递归算法-data structure that some simple programming, binary tree structure, traverse the non- recursive recursive algorithm

由于计算机存储的限制，当其所存储的数大于32位时，就会有溢出，该程序只要是实现大数加法 减法 乘法。-computer storage limitations, when it stored more than 32 a few hours, there will be a spillover, The procedure is as long as the majority addition subtraction multiplication.

是当初的数据结构的做业,用的是b+树这一块,非常值得初学者的参考-is the original data structure for doing business, it was a b tree this very worthwhile reference beginners

K阶菲波那契算法，运用环形队列实现，空间是K+1-K bands Fibonacci algorithm using circular Queuing, and the space is a K