同学通讯录系统,利用MFC编写,利用了数据库的技术

用链表实现了火车票信息以及火车经停站等信息。实现了链表中嵌套链表的功能，即利用两个链表存储火车信息，并且能够进行修改删除添加等基本功能。

Many applications use connection/object pool. A program may require a IMAP connection pool and LDAP connection pool. One could easily implement a IMAP connection pool, then take the existing code and implement a LDAP connection pool. The program grows, and now there is a need for a pool of threads. So just take the IMAP connection pool and convert that to a pool of threads (Copy, paste, find, replace????). Need to make some changes to the pool implementation? Not a very easy task, since the code has been duplicated in many places. Re-inventing source code is not an intelligent approach in an object oriented environment which encourages re-usability. It seems to make more sense to implement a pool that can contain any arbitrary type rather than duplicating code. How does one do that? The answer is to use type parameterization, more commonly referred to as templates.-connection/object pool. A program may require a IMAP connection po ol and LDAP connection pool. One could easily im plemen

本程序用邻接矩阵实现图的深度优先遍历 图的广度优先遍历-the procedures used adjacency matrix of the plan is to achieve depth-first traversal of the plan breadth priority Ergodic

C++语言对字符串对象进行各种操作的子程序，对运算符的重载，实现对字符串方便的各种操作。-C language string object to the operation of various subroutine, right Operators of heavy realize the convenience of a string operation.

应用背景把你的MS Access文件mysql数据库有问题？这是解决问题的方法。简单和直接…关键技术虽然很多人认为VB6被废弃，其性能仍然可以感受到了第一手的GUI应用程序设计。成千上万的应用程序运行在VB6。

在视频处理中经常要用到Zigzag序号及其逆序号，本文提供了一个新的类CZigzag，可以求任意m×n块的Zigzag序号及其逆序号。 由于所求的Zigzag序号及其逆序号为一次性遍历生成，其时间复杂度仅为O（m×n）。-In video often use to deal with the serial number and its reverse No. Zigzag, the paper provides a new category CZigzag, can seek arbitrary m × n block Zigzag its serial number and its reverse. Zigzag As the demand for its serial number and its reverse traversal generates one-time, its time complexity is only O (m × n).

本程序能读取系统环境变量,查看有无鼠标 .若有,便输出Mouse is OK, 反之便输出No mouse.

迷宫问题与运动会,有丰富的实例与测试数据，是学习数据结构的较好的资料！-Maze with the Games, has a wealth of examples and test data, data structure to learn the information better!

一元稀疏多项式计算器[加法和乘法] 问题描述： 设计一元系数多项式计数器实现两个多项式间的加法、减法。 基本要求： （1） 输入并建立多项式 （2） 输出多项式，输出形式为整数序列：n，c1，e1，c2，e2……cn，en，其中n是多项式的项数，ci，ei分别为第i项的系数和指数。序列按指数降序排列。 （3） 多项式a和b相加，建立多项式a+b，输出相加的多项式。 （4） 多项式a和b相减，建立多项式a-b，输出相减的多项式。 用带表头结点的单链表存储多项式。 测试数据： (1) (2x+5x8-3.1x11)+(7-5x8+11x9) (2) (6x-3-x+4.4x2-1.2x9)-(-6x-3+5.4x2+7.8x15) (3) (x+x2+x3)+0 (4) (x+x3)-(-x-x-3)-one yuan sparse polynomial calculator [Addition and multiplication] Problem description : Design one yuan polynomial coefficient counter achieve the two polynomials addition, subtraction. Basic requirements : (a) input and the establishment of polynomial (2) output polynomial, the output form of integer sequence : n, c1, e1, c2, e2 ... cn, en, where n is the polynomial Number, ci, ei for the first item i the coefficients and indexes. By sequencing index in descending order. (3) a and b polynomial addition, the establishment of a polynomial b, the combined output polynomial. (4) a and b polynomial subtraction, the establishment of a polyno

银行家算法分析报告（ c语言）-bankers algorithm analysis report (c language)