电梯模拟 的 Visual C++ 的代码

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

如何给链表数组赋值，很适合初学数据结构的朋友。-array assignment is well-suited to beginners data structure friend.

Window 编程例子, 比较cool !-Window programming examples, cool!

静态sql详细介绍了数据库结构数据库相关的内容，重点介绍和解释了sql语言的使用-Static sql database structure described in detail the contents of the database-related, focusing on and explain the use of language sql

一个出勤的数据库系统，很实用的，欢迎大家下在-An attendance database system, it is practical, welcomed everyone in

自己设计的一个简易的考勤管理系统，所使用的数据库为acce-a simple time and attendance management system，using access as database system

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

数据结构的课程设计，编程实现一个简单的分配问题！-Curriculum design, data structures, programming a simple allocation problem!

本文档容括了C（C＋＋）所有算法，分为数值算法、图论算法、背包算法、排序算法、高精度算法、树的遍历、进制转换、全排列和组合生成、查找算法、贪心、回溯法框架、DFS框架、BFS框架、数据结构相关算法。并有实例源码-This document, including the capacity C (C ) for all algorithms, divided into numerical algorithms, graph theory, algorithm, knapsack algorithm, sorting algorithm, high-precision algorithms, tree traversal, binary conversion, the whole arrangement and combination of generation, search algorithm, greedy , backtracking framework, DFS framework, BFS framework, data structure-correlation algorithm. And examples of source

基本数据结构类的定义和实现: MyStack ,MyPoint,MyArc,Graph,MyQueuesMyStack为构造的一个通用的C++模版堆栈类 MyPoint为一个坐标结构MyArc为带权的边类Graph为临街矩阵表示的图MyQueues为按权值顺序存储的边的队列-basic data structure class definition and realization : MyStack, MyPoint, MyArc, Graph, MyQueuesMyStack for a generic structure of the C category MyPoint stack template for a structure MyArc to coordinate with the right side of the street like Graph Matrix plans MyQueues value of the order by the right side of the storage Queue