err

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

建立家谱文件，可以添加新成员，输出指定家庭的所有成员，确定指定成员在家族中的辈份（第几代），输出指定辈的所有成员-The establishment of genealogy files, you can add new members, the output of all the designated family members, to determine the designated members of the seniority in the family (the first few generations), the output of all the members of the designated generation

房产中介信息管理 房产中介信息管理-Real Estate Agents Real Estate Agents Information Management Information Management

poj1411请多指教，多交流 0ms 交流算法-Please advice poj1411, more exchanges 0ms exchange algorithm

数据库实习的很好的课题-database attachment very good subject

swgl商务管理系统-swgl Business Management System

数据结构上让我们编写的排序算法，有冒泡，堆排序等-Data structure so that we prepared on sorting algorithms, there are bubble, heap sort, etc.

贸易公司管理包括可户信息管理 商品信息管理 经营信息管理等内容!-trading company management information including household goods management information management business information management and so on!

dfgdsfg sdfg dsfg dfsg dsfg dsfg sdf gsdg sdg sdfg sdgdsfg

vb多媒体数据库例子-vb examples of multimedia database