堆栈操作，用来实现大树精确加法，可以任意数的位数

聚类分析的使用， 个人感觉还不错哦。sfdfasdfasdfsdfasd-God， you can have a look.

房地产销售管理系统包括销售房屋、楼房信息管理、客户信息管理、员工信息管理、费用管理等功能。我的毕业设计，毕业论文和打包好的毕业程序代码和未打包的程序代码-real estate sales management system including sales of housing, building information management, customer information management, information management staff. cost management, and other functions. I graduated from the design, packaging and good thesis graduate program code and not the packaging code

最小化安装BDE环境 详细介绍了如何最小化安装BDE数据库支持环境，并详细说明各个子文件的功用。-BDE installed to minimize the environment described in detail how to minimize the installation of BDE database to support the environment, and a detailed description of the function of various subfolders.

完成数据结构的最小生成树，程序很实用，不需要修改！-The completion of the minimum spanning tree data structure, the program is very useful, do not need to change!

数据结构C++代码-data structure C code

数据结构课程设计，求无向网最短路径，利用c++6.0编程环境-data structure curriculum design, without seeking the shortest path to the net, using c 6.0 programming environment

酷Grid控件示例 ... ..cj.CDX ..............cj.dbf ..............MyGrid.SCT ..............MyGrid.scx ..............MZ.DBF .............. eadme.dbf .............. eadme.FPT .............. eadme.txt ..............xsda.CDX ..............xsda.dbf -Cool Grid Control example .............. cj.CDX ...... ........ cj.dbf .............. MyGrid.SCT .............. MyGrid.scx .............. MZ.DBF .............. readme.dbf ......... ..... readme.FPT .............. readme.tx t .............. xsda.CDX .............. x sda.dbf

排课表，对于给定的课程及其先序关系，给出所需学期数最少的排法。-Course Scheduling table, for a given sequence of courses and their relationship first, given at least the required number of semester scheduling method.

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

在java中链接数据库，代码量不多，但是麻雀虽小，五脏俱全！-in which links database, code volume is small, sparrow is small, perfectly formed!