DSebook

经典c程序100 每个都可以运行 内有目录-Classic c program 100 can run each of directories within the

最小生成树问题 若要在n个城市之间建设通信网络，只需要架设n-1条线路即可。如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题。 （1）利用克鲁斯卡尔算法求网的最小生成树。 （2）实现教科书6.5节中定义的抽象树类型 MFSet。以此表示构造生成树过程中的连通分量。 （3）以文本形式输出生成树中各条边以及他们的权值。 -minimum spanning tree problem to the n-city building communications networks needed to put up only n-1 lines can be. How the lowest economic cost of building the communications network, the network is a minimum spanning tree problem. (1) using Kelushikaer network algorithm for the minimum spanning tree. (2) to achieve 6.5 textbook definition of the abstract tree types MFSet. Spanning Tree Construction said this process of connectivity components. (3) the form of text output spanning trees and the edge of their weights.

后缀数组的一个C++实现，在字符串统计中有很大作用。-Suffix array of a C++ implementation, plays a significant role in statistics in the string.

VC6.0下开发的Access数据库小区管理系统-VC6.0 developed under the Community Access database management system

数据统计后生成图表，适用于报表等，简单实用！-data generated graphics, applicable to such statements, simple and practical!

浙大题库数据结构学习与项目指导 实验项目集 4-05. 家谱处理(Zhejiang University Exam 4-05. Genealogy processing)

说明：  斐波那契 式子计算，属于算法类的 用于VC6.0++(Fibonacci calculation formulas, algorithms are used to VC6.0++ class)

顺序查找 实现顺序查找的设计与实现 且加上了注释 更容易理解和上手-Find the order of search in order to achieve the design and implementation and the addition of annotations easier to understand and get started

query数据库的例子-example database query

教学大纲管理系统允许用户从任何课程的院校不同学科教学大纲查看