企业库存管理系统

Visual+C+++6.0数据库开发技术与工程实践（下），共7个实例，有源代码，使用前看光盘使用说明-Visual+ C+++6.0 database development Technology and Engineering Practice (below), a total of seven instances, active code, CD-ROM read instructions before use

本程序由C++实现内存管理，主要有新建进程和结束进程两个功能，这两个功能又通过链表的基本操作来完成，增加、删除结点，还有排序。

这是一则无刷新发帖的实例，也是对Ajax的一个实际应用，后台是Apache+PHP,数据是文本(之所以考虑文本方便，数据库的话还要先安装，反而搞的复杂，所以采用文本。当然了，实际应用当中是采用MySql还是文本可以另选)-This is a refreshing post had no examples of Ajax is also a practical application, the background is a Apache+ PHP, the data is text (the text is having convenient, if the database should be installed, but are engaged in complicated, so use a text . Of course, the practical application of which is used MySql or text can elect)

图的邻接矩阵存储结构 图的优先深度遍历-Graph adjacency matrix storage structure of the priority depth traversal

数据结构课程设计题，用C++语言实现二叉排序数，并对二叉排序数进行，插入，删除，修改等操作-insert delete change

vfp编写的简单计数器.可以轻松实现计数,清零等功能 -Probe preparation of simple counters. Easily count, reset function

利用栈和队列完成停车场的管理,数据结构的实习题目,并完成选做内容-use stack and queue complete parking management, and data structure of the internship topics, and complete the election to content

vc中利用ado访问Access文件（包含tree，datagrid控件）-vc use ado visit Access document (containing tree, datagrid control)

建立带表头结点的单链表，打印所有结点的数据域；输入一个值，若某个结点的数据域为该值，则在其后插入另一个新结点，若无此结点，则在表尾插入新结点，然后打印；给一个值，删除结点的数据域是该值的所有结点，然后打印。（表生成时可用前插法或后插法）-table with the establishment of the first node of a single linked list, print all nodes of the data domain; An input value, If a node"s data fields for the values, and subsequently inserted in a new node, in the absence of such nodes, at the end of the insertion of a new form nodes, then Print; to a value of the node to delete data domain is the value of all the nodes, then Print. (Table Generation available houses or after interpolation)

严蔚敏版本数据结构题集约瑟夫环问题的源代码-Yan Wei-min version of the title sets the data structure the source code of the problem, Joseph Ring