资源列表
sortoutside
- 外排序 对于海量数据进行快速排序 然后利用败者树进行归并的算法的一个模板-Outside the huge amount of data to sort for quick sort loser tree and then use the algorithm to merge a template
Bernoulli-Quee
- Bernoulli Quee 方便学习数据结构-Bernoulli Quee, a kind of data structure
FastDFS_v3.02.tar
- FastDFS系统，非常好用的分布式系统FastDFS系统，非常好用的分布式系统-FastDFS system, very easy to use distributed systems FastDFS system, very easy to use distributed systems
shanghaiACM
- 杭电ACM培训资料PPT和上海交大ACM队模板，另加算法pdf-Hangzhou Xinhua ACM training materials, and Shanghai Jiao Tong University ACM Team PPT template, plus algorithm pdf
AVL
- avl，数据结构，平衡查找二叉树，支持添加、删除、查找！
Floyd
- Floyd算法又称为弗洛伊德算法，插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法。-the Floyd Algorithm
Desktop
- 弗洛伊德算法最短距离的实现，输入为邻接矩阵，输出为最短距离矩阵。-Freud' s realization of the algorithm for the shortest distance, enter the adjacency matrix output for the shortest distance matrix.
dan_lian_biao
- 链式存储结构及应用 1．键盘输入一组元素，尾部插入法建立一个单向链表。 2．在单向链表中删除一个结点。 3．在链表中插入一个元素。 -Structure and application of a chain store. Keyboard input of a group of elements, the end of a one-way linked list insertion method. 2. In the one-way to remove a node lis
dijkstra_adjlist
- 有向图采用邻接表数据结构，求解一点到其余各点的最短路径以及长度-Directed graph using adjacency list data structure, solving the point to the remaining points and the length of the shortest path
2010quicksort
- c++用栈代替递归实现的快速排序，快速排序是一种比较节约时间的排序，一般用递归的方法实现，用栈虽然占用空间比递归大，但不要像递归一样把大多的时间浪费在递归的过程中，特别是对数字比较多的排序更有效-Recursive stack instead of using quick sort, quick sort is a kind of sorting to save time, usually with a recursive method to achieve, although the use
fuluoyide
- 弗洛伊德算法 实现任意两点之间最短路径的算法-fuluoyide suanfa
FastSearching
- 最近邻搜索算法，k_tree算法的大部分中文文献-Nearest neighbor search algorithm, k_tree algorithm for most of the Chinese literature