least squares curve fitting classic algorithms, the number of tests done, just c...

B＋树实现源码，JAVA语言，数据库索引技术-B+ Tree source, Java language, database indexing technology

最小生成树问题 若要在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.

用VB开发的一个学生管理系统，有基本的添加、修改、查询、删除的功能，还可以把这个系统安装-Using VB to develop a student management system, has the basic add, modify, query, delete function, the system can also be used to install

哈夫曼编码/译码 利用克鲁斯卡尔算法计算信息的哈夫曼编码，以便更好的利用通信信道。-Huffman encoding/decoding algorithm using Kruskal Huffman encoding of information in order to better use of communication channel.

vfp信息管理系统模版-Probe Information Management System template

VC进行数据库编程，MFC编写的，可以与CListCtrl控件配合使用-VC database programming, MFC prepared can be used in conjunction with the CListCtrl control

网上聊天室系统，本系统采用myeclipse开发环境和sqlserver2000数据库。-Online chat room system, this system development environment and myeclipse database sqlserver2000.

用c实现的判断一个图是否有环，数据结构中的经典算法，输入一个图，然后判断是否有环。-used to achieve a judgment whether there are plans in Central and data structure of classical algorithm, the importation of a map, and then determine whether there is any ring.

CShap代码 冒泡排序，选择排序，插入排序，希尔排序 算法-Code CShap Bubble Sort, Selection Sort, Insertion Sort, Hill sorting algorithm

各种实用的子程序，包括数据类型的转换，芯片的驱动等-various practical subroutine, including the conversion of data types, such as driver chips