数据结构的源程序约瑟夫环和最短路径

数据结构中著名的汉诺塔问题的实现，基于C++实现-Data structure of the famous Tower of Hanoi problem to achieve, based on C++ implementation

图书管理系统源代码及报告分析，图书管理系统源代码及报告分析-Library management system source code and reports analysis, library management system source code and reports analysis of

1．定义哈希表数据结构。 2．除留余数法做为哈希函数、 H(key) = key P 用线性探测再散列解决冲突方法，编写函数，实现哈希造表的过程，并输出哈希表。 3．编写函数，求查找成功时的平均查找长度（ASL）。-1. Define hash table data structure. 2. In addition to leaving the remainder as the hash function method, H (key) = key P re-hashing with linear probing methods of conflict resolution, write a function to achieve the hash table making process and output of the hash table. 3. Write function, seeking to find success, the average search length (ASL).

十字链表(数据结构作业)- Cross chain table (construction of data work)

这是一个银行IC卡门禁系统软件-Bank IC Card Access Control System Software

如何备份和还原 MYSQL 数据基地 PROGRAMATICALY 与 VB 6.0 使用 MYSQL 转储程序来备份和还原到 MYSQL.exe。

酒店住宿管理系统,有完整的文件和源码, 可以下载使用-hotel management system, complete documentation and source code can be downloaded for use

利用人大金仓提供的kci接口实现对数据库的访问，主要提供了数据库的连接、断开连接、执行增删改查和事务开启、事务回滚、事务提交等操作。此外还提供了数据库连接池和监控线程、维护线程从而提供数据库的访问效率，是一个不可多得的Kci封装接口。

本程序是一个校园导游咨询系统，提供校园内各景点的信息咨询和最点路径查询功能。-This procedure is a consultation system for the campus tour guides, provide campus information tourist attractions and the most points the path of the inquiry.

一． 问题描述很多涉及图上操作的算法都是以图的遍历为基础的。试写一个程序，演示在连通的无向图上访问全部节点的操作。二． 基本要求以邻接多重链表为存储结构。实现连通无向图的深度和广度优先遍历。以用户指定的节点为起点，分别输出每种遍历下的节点访问序列和相应生成树的边集。-one. Description many issues involving maps of algorithms are to traverse the map-based. A written test procedures, demonstrating the connectivity of undirected graph visit all the nodes on the operation. 2. Adjacent to the basic requirements for storage of multiple linked list structure. Connectivity to the map without the depth and breadth- first traversal. User specified nodes as a starting point, the output of each node traversal visit Spanning Tree sequence and the corresponding set of edges.