在Visual C++访问Borland数据库引擎(BDE)，可实现对数据库的访问

此文件包含组成 calc24point 应用程序的每个文件的内容摘要。-calc24point application components of each document summary of the contents.

数据库设计60个技巧-Database design skills 60

一个数据结构的大作业-a data structure of operation

数据结构中关于图的遍历，任意建节点，深度优先和广度优先两种方法-data structure on the map traverse, arbitrary nodes built, the depth and breadth of priority priority two methods

一个递归算法,并把递归出的文件隐藏,使用VB开发,希望大家支持-A recursive algorithm, and recursive documents are hidden, use the VB development, I hope you will support

权限管理数据库设计，需求陈述，设计描述，数据库表的设计！-Rights management database design, requirements statements, design description, the design of database tables!

创建二叉树，并实现二叉树前序、中序递归遍历算法和二叉树的后序非递归遍历-create binary tree, and to achieve binary tree before the sequence, sequence recursive traversal of a binary tree algorithm and after non- recursive traversal sequence

这是一个有关于VC++6.0与数据库ACCESS相结合的小程序-This is a database on the VC++6.0 with a combination of small programs ACCESS

双向循环链表节点：数据域+指针域指针域：一个指针指向前一个同类型节点，另一个指针指向后一个同类型节点（1）设计节点struct db_node{int data;struct db_node * prev;struct db_node * next;};（2）创建空链表//创建了一个只有头节点的双向循环链表，返回头节点的地址struct db_node * create_db_list(void){struct db_node * phead = (struct db_node *)malloc(sizeof(struct db_node));if(phead == NULL)exit(-1);else{phead->next = phead;phead->prev = phead;}return phead;}（3）制造新节点//制造新节点，返回新节点的地址struct db_node * make_db_node(int value){struct db_node * pnew = (struct db_node *)malloc(sizeof(struct db_node));if(pnew == NULL)printf("malloc failed! ");else{pnew->data = value;pnew->next = NULL;pnew->prev = NULL;}return pnew;}（4）插入节点//把pnew指向的节点插入到头节点的前面，也就是整个链表的末尾bo

腐蚀，膨胀，细化算法代码能够实现你想要的算法代码-corrosion, swelling, thinning algorithm code you want to achieve the algorithm code