资源列表
Haffman
- 严蔚敏 数据结构 C++ 哈夫曼编码 哈夫曼树-YanWeiMin Huffman Huffman tree data structure
Kmerge
- 严蔚敏 数据结构 K路归并+败者树实现外部排序-YanWeiMin K Road merge data structure to achieve external sort+ loser tree
lcs_length
- lcs-search 查找两个字符串的最长公共子串-implementation of searching maxium sub-sequence of two character string.
drawing-program
- 绘图程序,MATLAB de yuandaima-Drawing program
shunxubiaodehebing
- 创建两个顺序表，通过指针的方式实现顺序表的合并-Create two order table, through the pointer way to realize the merger of the sequence table
xishujuzhnedezhuanzhiyucunchu
- 通过三元组和快速转置两种方法实现对稀疏矩阵 的转置与存储-Through a triple and rapid transposed two methods of sparse matrix The transpose and storage
zuixiaoshengchengshusuanfa
- 通过数组的方式创建网，然后分别用克鲁斯卡尔和普里姆算法求得最小生成树-Create network by means of an array, and then separately in kruskal minimum spanning tree algorithm and she obtained
data-sorting--Graph-Theory
- 介绍工程实用简单图论问题的并行算法及其MPI编程实现-MPI parallel programming algorithm and introduce practical engineering problems to achieve a simple graph theory
AutoAssi
- 三叉树源，三叉树可以有效地处理数据的查询，尤其是数据字典-Triple Tree source, trigeminal trees can efficiently process the query data, especially data dictionary
dijkstra
- 数据结构中dijkstra单源最短路径算法-dijkstra single-source shortest path algorithm
stil
- 双向链表很好的，大家可以指导双向链表很好的，大家可以指-A two-way linked list is very good, we can guide
BTree
- B树的JAVA语言实现，B树是一棵平衡树，可用于一维数据的高效索引-B-tree JAVA language, B tree is a tree balanced tree can be used for efficient indexing one-dimensional data