实验数据结构，第一个教科书（1）互联网接入…

一些算法的实现，用的是pascal，包括数论、图论、高精度计算、排序算法、背包问题等。-The realization of a number of algorithms, using the pascal, including number theory, graph theory, high-precision computing, sorting algorithms, and so on knapsack problem.

自己写的，数据结构课程设计，有需要的可以来看看看的，郁闷上传这麻烦-Their written curriculum design data structure, there is a need to look at to see if the can, and depressed From this trouble

北京邮电大学软件工程研究生的课程---数据库设计开发-0-1.1.ppt ... 北京邮电大学软件工程研究生的课程---数据库设计开发-5.2.ppt-Beijing University of Posts and Telecommunications Software Engineering postgraduate courses- Database design and development-0-1.1.ppt ... Beijing University of Posts and Telecommunications Software Engineering postgraduate courses- Database design and development-5.2.ppt

使用mfc通过odbc链接sql数据库，跟大家分享，不错的代码，简单易懂！   为了简化开发人员编写数据库应用程序，VC++的在其基础类库（MFC）里对ODBC API进行了封装，实现了一个面向对象的数据库编程接口，使VC++的数据库变得更加容易。 本章首先对MFC ODBC的概貌进行简要介绍，然后讲述利用MFC ODBC进行数据库开发的技巧，最后将通过具体数据库开发实例，详细讲述通过MFC ODBC开发数据库应用程序的方法和过程。  

哈夫曼树和哈夫曼编码： 从终端输入若干个字符及其对应的整数，将整数作为结点的权值，建立哈夫曼树，然后对各字符进行哈夫曼编码。最后打印哈夫曼树和对应的哈夫曼编码。 设计要求： ⑴ 哈夫曼殊和哈夫曼编码的存储表示参考教材事例 ⑵ 在程序中构造四个子程序为 ① int createhtree(HTree *t) /*根据输入的字符及其权值建立哈夫曼树*/ ② void coding(HTree *t, char *code) /*对哈夫曼树进行编码*/ ③ void printhtree(HTree *t, int* path) /*中序打印树*/ ④ void printcode(HTree *t) /*输出个字符的哈夫曼编码*/ -Huffman tree and the Huffman coding: input from the terminal a number of characters and their corresponding integer, will be an integer as node weights, the establishment of Huffman tree, and then on the characters Huffman. Finally print Huffman tree and the corresponding Huffman. Design requirements: ⑴ Huffman and Huffman coding is that the reference materials storage ⑵ examples constructed in the procedure for the four subroutines ① int createhtree (HTree* t)/* input characters in accordance with its right value the establishment of Huffman tree*/② void coding (HTree* t, char* code)/* Huffman tree to encode*/③ void printhtree (HTree* t, int* path)/* Pri

著名的15谜游戏（15-puzzle ）的Tcl/Tk版本，现在它可以有 4x4, 5x5 或6x6 的格子，所以更加有趣，改变图片也更加容易。 -mystery of the famous 15 games (15-puzzle) Tcl/Tk editions, it could 4x4, 5x5 or 6x6 lattice, the more interesting and change the picture much easier.

线性表常用算法集合，含所有线性表基本的算法，与吴伟民编的数据结构书完全配套，用TC实现，经过运行。-linear algorithm commonly used pool table, table containing all the basic linear algorithms, and Xiulan WU Weimin series of the data structure was fully complementary with TC realization, after running.

数据连接程序放到数据库里，登陆发现新版本则下载.-data link procedures into databases, landing discover new version will download.

前k条最短路径（KSP）算法在国内鲜有研究，本压缩包中文献整合了自1971年此问题被提出后几十年来的论文共25篇。 其中以Martin先生的删除（Delelte）算法与Yen先生的背离（Devation）算法为主。 其中所有文献均来自网络。含有两篇中文文章以及23篇英文文章。 算法的复杂度基本控制于O(logn)内-Pre-k shortest paths (KSP) algorithm in the domestic few studies in the literature in this compressed package integration since 1971, this issue has been moved for several decades a total of 25 papers. Among them, Mr. Martin removed (Delelte) algorithm and Mr. Yen departure (Devation) algorithm is based. In which all documents are from the network. Contains two Chinese articles and 23 articles in English. The complexity of basic control algorithms in O (logn) in

关于计算机几种常见排序算法，在学习数据结构的时候曾自己动手写C语言的程序， 现发布出来与大家交流。虽然简单，但希望与大家在编程以及计算机算法方面能 够与大家交流，达到抛砖引玉的效果，恳切大家提出意见、建议。-On the computer several common sorting algorithms, data structures in the study had the time to write their own C language procedures, is published by the exchange with the U.S.. Although simple, but look forward to working with everyone in the programming and computer algorithms can exchange with the U.S. to initiate the effect, everyone sincerely offer comments, suggestions.