资源列表
MurmurHash
- mur hash是 Austin Appleby于2008年创立的一种非加密hash算法，适用于基于hash进行查找的场景。murmurhash在多个开源项目中得到应用，包括libstdc、libmemcached、nginx、hadoop等。-MurmurHash is a non-cryptographic hash function suitable for general hash-based lookup. It was created by Austin Appleby in 200
datastruct1
- 一些数据结构算法的例子，包括哈夫曼编码、图的表示、关键路径、最短路径等-Some examples of data structure algorithms, including Huffman coding, map, said the critical path, the shortest path, etc.
邻接矩阵表示图
- 用邻接矩阵存储表示图的结构，采用的是深度优先算法
dsa
- 这里包含有数据结构中所有的的算法和代码，非常适合学习数据结构的人，有栈，队，链表，图等等经典算法，非常适用-It contains all of the data structure algorithms and code,which is very suitable for starte learning data structures, such as stack, team, list, graph and so on ,it is very useful
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