矩阵运算

这是一个用C++编写的代码,实现了最小堆和最小左偏树在插入删除元素性能方面进行比较. -This is a preparation of the C code, the smallest and youngest sculpture tree in the left side inserted delete elements performance comparisons.

二叉树操作源代码，以及关键源代码的注解说明-Operation of the source code tree, as well as the key to the source code annotation Help

数据结构和算法,C++描述，数据结构习题，数据结构答案-datastruct

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

在 m 表示的资源数 sj ； t代表机 Mj 的速度在时间间隔 [t; t + 1)。我们可以万无一失地想当然不失一般性，处理器速度的变化不在规格内 ed 间隔

图的深度遍历，用二叉树实现，输入时要遵循二叉树的顶点和边数的对应关系-traverse the depth map, using binary tree realize that the importation of binary tree to be followed when the number of vertices and edges of the relationship

宾馆管理信息系统-Hotels Management Information System

操作系统编程实验报告，呵呵，从老师的电脑里偷来的。-OS programming experiment, huh, from the teacher"s computer stolen.

经典的数据结构算法-classical algorithm data structure

是一个很不错的软件噢-is a very good software Oh