Algorithm for four

C数据结构常用算法程序集５，描述数据结构算法。-C data structures commonly used algorithm suite 5, describe data structure algorithms.

双端堆是支持双端优先队列的插入、删除最小元素和最大元素等操作的堆。 双端堆可以在对数时间内完成上述所有的操作。 -Double-ended heap to support double-ended priority queue insert, delete the smallest element and the largest such operation of the reactor element. Double-ended heap in logarithmic time to complete all of the above operation.

本程序是一个用prim算法寻找最小生成树的小程序。-this procedure is a prim with minimum spanning tree algorithm for small procedures.

单链表的一些简单算法。-some simple algorithm.

很多的vb经典源代码-many classic vb source code

实现M/M/1单窗口无限排队系统的系统仿真，利用事件调度法实现离散事件系统仿真，并统计平均队列长度以及平均等待时间等值，以与理论分析结果进行对比。 M/M/1排队系统： 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

所有数理统计知识的源代码都在此,是一本数理统计数的配套光盘.里面有各种分布类型及参数估计插值-all mathematical statistical knowledge of the source code here is a mathematical statistical matching CD. There are various types and the distribution parameter estimation interpolation, etc.

一种基于二维链表的稀疏矩阵模半板类设计 A template Class of sparse matrix. Key technology: bin,2-m linked matrix. constructors: 1.normal constuctor 2.copy constuctor. 3.assignment constructor. Basic operator: 1. addition(sub) of two matrix 2. inverse of a matrix. 3. multiply of two matrix. etc.-based on two-dimensional chain of sparse matrix model semi-plate design of Class A"s template parse matrix. Key technology : bin. 2-m linked matrix. constructors : 1.normal constuctor 2.copy constuctor. 3.ass ignment constructor. Basic operator : 1. addition (sub) 2 matrix of two. inverse of a ma trix. 3. multiply of two matrix. etc

0-1背包和 背包问题的动态规划 源程序 只是测试 不过要自己输入 还要自己加入 很简单就没有更改-0-1 knapsack problem knapsack and the dynamic programming source code is to test but also to input their own entry is very there is no simple changes

本设计完成了要求的所有功能，可由系统建立一张图或者由用户自行建立一张图,并对该图进行关键路径的搜寻.用户界面友好，有用户使用说明,每一步操作都有说明与提示。程序运行通过，有详细的解释说明。-the design completed all the required functions, from the establishment of a system or plan established by the users themselves a map, and this map critical path of the search. User friendly interface, users note, every step of the operation have notes and hints. Running through a detailed explanation.