data structure Learning Guide "book on the source

用VB6.0实现的最短路径分析，采用了优化的方法（搜索方向一致性）-Using VB6.0 to achieve the shortest path analysis, using optimization methods (search direction consistency)

这个程序使用递归解决汉诺塔游戏的问题。 这个程序将所有盘从嘴左边的指针处移动到最右边，并满足以下要求1) 一次仅移动一个盘子.2)移除的盘子必须放到一个指针下面 3)大盘子不能放在小盘子上面

北大在线题库3468题标程代码，经典数据结构“线段树”的完美运用-Beijing 3468 title online questions marked-way code, data structure of the classic

使用数据库的VC编程实现，一个简单的DEMO-use of the VC database programming, a simple DEMO

dijkstra算法，用于寻找已建立图的最短路径，是非常有用的一个算法-Dijkstra algorithm, has been established for finding the shortest path map is a very useful algorithm

对二叉树的遍历的简单实现，作为数据结构的入门程序还是很好的，虽然很简单但是当初我作为初学者想方设法写出这个小程序的时候还是发现了自己理解上的一些盲点。数据结构重在实践，大家多练~一起加油，里面还包含了我最开始写的时候容易犯的一些错误。里面有为实现层次遍历写到的队列结构和为非递归用到的栈的结构。

CBASE v1.01 采用Borland公司TC++编写的数据库管理源程序库-CBASE v1.01 using Borland TC prepared by the source database management library

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

双线程对一系列随机数进行归并排序，使用MFC的控制台程序-Dual-threaded on a series of random numbers to merge sort, using the Console application in MFC

本文件主要完成Kruskal算法。本文件包括三个类，分别是顶点类、边类和Kruskal类。-The document completed Kruskal algorithm. This document consists of three categories, namely category vertex, edge type and Kruskal category.