本程序用于数据结构中关于图部分的广度优先搜索和深度优先搜索。...

数据库监视备份软件客户端通信软件广播状态参数 当前的主库(DWORD)+当前的状态(DWORD) -Database to monitor the backup software client software radio communication parameters the current state of the main library (DWORD)+ Current status (DWORD)

迷宫的又一解法。该算法简单、实用、可读性强，是学习递归和回溯很好的例子。-maze of another solution. The algorithm is simple, practical and readable study is recursive and backtracking good example.

About: hamsterdb is a database engine written in ANSI C. It supports a B+Tree index structure, uses memory mapped I/O (if available), supports cursors, and can create in-memory databases. Release focus: Major feature enhancements Changes: This release comes with many changes and new features. It can manage multiple databases in one file. A new flag (HAM_LOCK_EXCLUSIVE) places an exclusive lock on the file. hamsterdb was ported to Windows CE, and the Solution file for Visual Studio 2005 now supports builds for x64. Several minor bugs were fixed, performance was improved, and small API changes occurred. Pre-built libraries for Windows (32-bit and 64-bit) are available for download. Author: cruppstahl

严蔚敏编写的《数据结构》第2章的答案，全部为源码-the answers of chapter two of a book called ‘Data Structures’ writen by Yan Wei Min

四则运算实现，这个算法是用C语言实现的，算法程序代码明确易懂。-four Operators realize that this algorithm is used to achieve the C language, the algorithm code clear and understandable.

数据结构中图的相关操作,数据结构中图的相关操作-data structure of the plan related operations, data structure of the plan related to operation

分支限界tsp算法中求下界函数的值。有中文注释。-Tsp branch and bound algorithm for the lower bound of the value function. Chinese Notes.

一个简单的记录集类，可以操作单个数据文件，可以用来存放单表数据-A simple type recordsets, you can operate a single data file that can be used to store a single table of data

C++方面有深度的算法例子，提供完整源代码-C++ Aspects algorithm-depth examples, provide a complete source code

该源代码利用计算机模拟乘法竖式 计算阶乘 将每位数子保存在用new分配的一长字符数组里 在本人的机子上可计算30000!的精确值 用时近60秒-the source code used a computer simulation multiplication calculation factorial shaft will be preserved for each digit used in the distribution of a new long arrays of characters in my machine on computable 30,000! The precise value of time spent nearly 60 seconds