资源列表
ACM.rar
- ACM比赛解题报告,包括hdu1880、zoj1010、zoj1015，为原创的报告，算法不一定最优的,ACM problem-solving competition, including hdu1880, zoj1010, zoj1015, for the original report, the algorithm does not necessarily optimal
zoj_1004_Anagrams_by_Stack.rar
- zoj 1004 的题目，这是一个经典的水壶倒水问题，题目中没有要求最少的次数倒满水，所以还可以不用bfs，本题用了bfs,zoj 1004 topics, this is a classic problem of water pouring money down the drain, the title does not require a minimum number of filling water, so it can be bfs, the title used bfs
zuixiaoshengchengshu.rar
- 1． 利用克鲁斯卡尔算法求网的最小生成树 2.以存储边（带权）的数组表示图,1. Kruskal algorithm using minimum spanning tree for network 2. To store edge (with the right of) the array that map
hugeintplus.rar
- 100位的大整数加减法.输入格式可以任意,要带符号+ -,不带或者只有一个带都可以.允许输入的数前面有多个0(可以超过100).,Big Integer Plus and minus.
List.rar
- 单向链表的标准c++实现范例 数据结构 面向对象 生成函数 复制函数 赋值函数 操作符重载,The standard one-way linked list c++ to achieve an example of object-oriented data structure constructor function Copy function overloaded assignment operator function
sort.rar
- 由C++实现的各种排序算法，包括直接插入排序、希尔排序、冒泡排序、快速排序、选择排序等,By the C++ to achieve a variety of sorting algorithms, including the direct insertion sort, Hill sort, bubble sort, quick sort, selection sort, etc.
MapGuide.rar
- 超强寻找最短路径和全部结点遍历。用了GDI显示。,Super find the shortest path and all nodes traversal.
Prim.rar
- 用普里姆（Prim)算法求用邻接矩阵存储结构表示的图或网的最小生成树,With the prim algorithm is seeking to use adjacency matrix storage structure, said the plan or network, minimum spanning tree
DataStatistics.rar
- 对给定书的总页码，计算出书的全部页码中分别用到多少次数字0，1，2，3...9.,DataStatistics
bBTREE.rar
- B+树实现索引的源程序 一个数据库管理系统的项目 ,B+ tree index source to achieve a database management system project
graph_kruskal
- 最小生成树经典代码，，，很有逻辑性，，，希望对你有帮助-Classical minimum spanning tree code,,, very logical
Md5
- 用于生成MD5，对大文件操作非常的快，我用了，特别NB的呢。-Used to generate MD5, operations on large files very fast, I used, especially NB in it.