using Windows API, including how to control the menu display and hidden menu ite...

Access数据库下实现的系统，功能很强大，适合初学者学习~-Implemented under the Access database system, function is very powerful, suitable for beginners to learn ~

红黑树：输入：在同一目录下的redblacktree.txt文件中输入十个大于0的数值，每个数值中间用空格格开 数目可以大于十个，但是要求在源程序中改变＃define NUM 10 ，改成相应关键值各个数输出：按照先序输出红黑树，格式为：根节点。颜色（左子树。颜色，右子树。颜色），并输出此 树的黑高度，然后输入要删除的关键值，按回车后输出删除后的结果，并输出其高度。-RED-BLACK TREE : Admission : in the same directory under the file input redblacktree.txt greater than 0 10 digits each intermediate numerical grid with open spaces can be greater than the number 10, but requested change in the source# define NUM 10, the corresponding critical value into several different output : In accordance with the first sequence RED-BLACK TREE output format : nodes. Color (left subtree. Color, right subtrees. Color), and export of the black tree height and then delete the key to value, according to enter the output was the result of the deletion, and its high output.

在0和1情况下进行背包问题解决，涉及多个物体的重量和价值，求得最大价值量以及分配方案。-At 0 and 1 backpack case for problem-solving, involving more than the weight of objects and values, as well as to achieve maximum value distribution program.

动态连接ODBC数据库.使用通过数据源的名称动态链接访问ODBC数据库，如果程序中使用的数据库程序运行时是不确定的，数据库表中的域和记录可能被改变，那么通过指向数据库的数据源动态的对该数据库进行操作是比较好的方法．-Dynamic Link ODBC database. Data sources through the use of the name of Dynamic Link visit ODBC databases, If the procedure is used in the database program running is uncertain, database table fields and the record is likely to be altered, So, through the database at the data source dynamic database operation that is a better one.

用JSP链接到数据库使用起来非常简单，CUT然后PASTE，原代码中我给出了详细的注释。-Using JSP link to the database is very simple to use, then PASTE CUT, the original code I presented a detailed notes.

可重用的，PYQT编写的oracle数据库登录通用窗口（通过录入数据库IP地址、端口，用户名、密码等），

以十字链表表示稀疏矩阵,实现两个矩阵的相加,相减,和相乘的运算.-List said with a crossbow sparse matrix, the matrix to achieve two together, subtraction, multiplication and arithmetic.

图的遍历，在连通的无向图上访问全部节点的操作-Graph traversal, in the undirected graph connectivity to access all the nodes to operate

三个求二分图最大匹配的程序（bfs，dfs，多增光路算法）-Three for the maximum bipartite graph matching procedure (bfs, dfs, multi-path algorithm Zengguang)

c++链式队列的实现头文件如下： typedef int Item; typedef struct node * PNode; typedef struct node {  Item data;  PNode next; }Node; typedef struct {  PNode front;  PNode rear;  int size; }Queue; /*构造一个空队列*/ Queue *InitQueue(); /*销毁一个队列*/ void DestroyQueue(Queue *pqueue); /*清空一个队列*/ void ClearQueue(Queue *pqueue); /*判断队列是否为空*/ int IsEmpty(Queue *pqueue); /*返回队列大小*/ int GetSize(Queue *pqueue); /*返回队头元素*/ PNode GetFront(Queue *pqueue,Item *pitem); /*返回队尾元素*/ PNode GetRear(Queue *pqueue,Item *pitem); /*将新元素入队*/ PNode EnQueue(Queue *pqueue,Item item); /*队头元素出队*/ PNode DeQueue(Queue *pqueue,Item *pitem); /*遍历队列并对各数据项调用visit函数*/ void QueueTraverse(Queue *pqueue,void (*visit)());