err

链表的基本操作，循环链表的一个应用实例，围桌问题的一个解决方法!-Chain basic operation, the recycling Chain an example, sat around the table in a solution!

单源最短路径算法的C语言实现，刚学算法时写的，多多指教

大学用数据结构课件 来自北京工业大学的 需要的尽管下载-University of courseware using the data structure from the Beijing University of Technology, even though it needs to download

数据结构单链表的实现,包含链表元素的删除,查找,插入-single linked list data structure to achieve List contains elements delete, retrieve, insert

数据结构中实现图的关键路径的算法，是在TC中运行的。-data structure to achieve the critical path map algorithm is run in the TC.

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

在安装多个打印机的系统中,如果没有指定打印机,打印内容将被自动输出到默认打印机.本程序指定打印机设置为默认window打印机.-printers installed in the system, if not specified printers, print content will be automatically output to the default printer. The procedures specified printer settings to the default window printers.

sqlite读写VC例子,很不错，值得收藏研究！-sqlite read VC example, it is good, worthy of study collections!

数据结构CAI系统-用C语言开发的教学辅助系统。-data structure CAI system-C language teaching aids development of the system.

货郎担分枝限界图形演示 问题描述:某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。-traveling salesman Branch and Bound graphic demonstration Problem description : A salesman to a number of cities to sell commodities, the known distance between cities (or travel). He selected a departure from the resident, after each city again, the last resident to return to the line, making the total distance (or travel) is the smallest.