Delphi XML序列化库

《数据结构》配书光盘 内容包括：线性表，栈和队列，串，数组与广义表，树，图，查找，排序等所以算法。 该光盘中配有《数据结构》一书中的所有算法、每一个算法的 C 程序（后缀为 .cpp 的文件）及可执行文件（后缀为 .exe 的文件）。-"data structure" assigned CD include : linear table, stack and queue, strings, arrays and broad scale tree, map, search, sort, etc. So algorithm. The CD-ROM equipped with a "data structure," a book of all the algorithm, the algorithm for each one C (suffix. Cpp files) and the executable file (wayward. Exe files).

自动抄表计费系统、 基于 GSM。其我的项目。bt 不幸的是我可以没有准备好到AT89S52 微控制器方案......，所以请能 at89s52 microcontrollr 编程数据......plz 帮我

数据结构课程设计报告,算术表达式求值,自动辨别算符优先级,括号,将char型转换成int计算,再将结果显示,具有精美用户界面-data structure curriculum design, arithmetic expression evaluates automatically identify operator precedence, in brackets, char to int conversion type, the result shows that the user interface is attractive

数据结构经典算法的实现-data structure to achieve the classical algorithm

本系统为内部系统，帐户由管理员添加、管理； 分为两个组，User组和Boss组。Boss组的帐户可以发广播通知； 任意两个用户间可以互相通信； 数据库接口用DAO，网络通信用 CSocket+CSocketFile；-the system to internal system administrator account by adding, management; Divided into two groups, User Group and the Boss group. Boss Group accounts Broadcasting notice can be issued; Between any two users can communicate with each other; Using DAO Database Interface, Network Communication CSocket CSocketFile;

我们在学习外省市先进经验的基础上，结合教材管理工作实际情况和多年的工作经验，组织了专门人员与协力电脑公司利用Vb6.0程序语言和SQL数据库语言共同开发研制了“河北广播电-we learn advanced experience of other provinces and cities on the basis of materials management with the actual situation, and many years of work experience, organized with the help of specialized personnel computer companies use Vb6.0 programming language and SQL database language jointly developed "Hebei Radio

Visual basic + sql server2000学员管理系统原代码-Visual basic+ sql server2000 student management system source

VC6.0下开发的Access数据库小区管理系统-VC6.0 developed under the Community Access database management system

资源描述数据结构图论课后题，对于初学数据结构课程的学生有很大帮助

双向循环链表节点：数据域+指针域指针域：一个指针指向前一个同类型节点，另一个指针指向后一个同类型节点（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