ArtiAnomalyG

单链表的实现方法，很简单的程序，但是是入门者的必经之路-single Chain method, a very simple procedure, but it is a must to beginners

最小生成树的贪心算法实现 普里姆算法 用邻接矩阵进行图的生成-the minimum spanning tree algorithm Primbetov greedy algorithm adjacent matrix chart generation

这是在邻接表的基础上实现的多段图的向前算法-This the adjacency list on the basis of the multi-map algorithm forward ... ... ...

北京邮电大学计算机应用硕士论文__数据仓库体系结构设计 包括答辩稿 水平自然是高希望对你有所帮助-Beijing University of Posts and Telecommunications Computer Application master"s thesis __ data warehouse architecture design includes text reply is naturally high level of hope for your help

（1）满足均匀分布的[M,N]区间随机数，其中M,N是正整数。 (2) 满足指数分布的[M,N]区间随机数，其中M,N是正整数。 -(1) satisfy the uniform distribution of [M, N] interval of random numbers, in which M, N be a positive integer. (2) to meet the exponential distribution of [M, N] interval of random numbers, in which M, N be a positive integer.

zoj 400道ACM 源码，是在ZOJ混的ACMer必备。希望对大家有点帮助。-zoj 400 Dao ACM source code, is essential in the ZOJ mixing ACMer. Hope to everyone to some extent.

陷波滤波器（notch filter）算法说明和设计过程，并给出了MATLAB的实现。一个非常好的例程，经过了仔细测试！-Notch Filter (notch filter) algorithm description and design process, given the realization of MATLAB. A very good routines, after careful testing!

ado+ACCE

货郎担 最短路径问题 用链表储存最短路径节点-traveling salesman problem using the shortest path Listless storage nodes Shortest Path

用链表实现的大数阶乘，可以计算n万的阶乘，不过3万以上，时间就很长了。-List realize with the factorial of large numbers, can calculate the factorial of n million, but more than 30,000, time is very long.