资源列表
btree-vv
- 图书馆管理系统，3阶b树 数据结构实验，简单易懂 初学者的作品-library management system, three bands b experimental tree data structure, simple works beginners
bintytrees
- 二进制查找树实现代码 BinaryTree.c BinaryTree.h bst.dsp TreeClient.c item.h-Binary Search Tree code BinaryTree.c BinaryTree.h bst.dsp TreeClient.c item.h
huffmanFORdatastreamcompress
- 用于数据流压缩的huffman算法源代码，c++编写，程序十分简练-data flow for the Huffman compression algorithm source code, c preparation, the procedure was very concise
SUMTtttttxxx
- 内点惩罚法,fortran77编制可以在visual fortran运行-penalty points within the law, can be prepared in FORTRAN77 visual FORTRAN running
libnumrecognitiondemo_0.01
- number recognition! n umber recognition! number recognition!-number recognition! N umber recognition! Number recognition!
letoucaipiao
- 一些关于乐透彩票的基本算法,后面的程序都是用VB编的，同大家都用这VB吧！有兴趣的朋友可以来看看，讨论一下！没有这方面兴趣的朋友，我想也可以看看的，这里面有许多的算法真得很实用。-some lottery tickets on the basic algorithm, as the procedures are using VB series, we have used with this VB! Interested friends can come to see, discuss! No s
FittingApproximation
- 收集的一些常用算法，分得很细，使用方便，与大家分享-collection of some commonly used algorithm, at very small, easy to use and share
suanfafenxiyushejiWangxiaodong
- 常用算法的java实现不错的书 特此贡献大家 好书一起分享-java commonly used algorithm to achieve a good book you would like to contribute books to share
dis_math
- 实用的离散数学课件，在本人的教学过程中已经多次使用，-practical discrete mathematics courseware, in the process of teaching I have many uses,
thin-image
- 这是关于细化算法的一个源码，我在国外网站下载的，没有密码就可以解压，愿和大家一起共享！-This is a refinement of the algorithm source code, my foreign websites, and no password can be extracted, and is willing to share with everyone!
0204030213
- 对8组包含不同个数据的向量进行排序，记录采用不同算法所需的运算次数，测试数据随机产生-right group includes eight different data for the vector sequence and recorded using different algorithms for computing the number test data randomly generated
graphDegree
- 求图的顶点连通度算法。方法就是先对源和汇做枚举，之后对每个枚举情况，把除去源汇两点的其余所有顶点看成是容量限制为1的点，求网络的最大流，就是此点对的顶点连通度，之后对枚举的所有点对找连通度最小的当成图的连通度。 带有顶点容量限制的最大流方法：将带容量限制的顶点u拆成两个点u 和u*，原顶点u的入边为u 的入边，原顶点u的出边为u*的出边，之后在u 和u*之间连接双向边，边的容量为顶点的容量限制。-plans for the vertex connectivity algorithms. F