资源列表
Bellman-Ford-queue-optimization
- Bellman-Ford算法关键之处在于：只有那些在前一遍松弛中改变了最短路程估计值的顶点，才能引起它们邻接点最短路程估计值发生改变。-Bellman-Ford algorithm that crucial point: Only those former slack again changed the vertex shortest distance estimates, causing their neighbors to the shortest distance estimates ch
MRELFFT
- 利用分裂基算法求实序列 的DFT， 的虚部赋值为零。-Split-radix algorithm for the use of realistic sequence of DFT, the imaginary part of the assignment to zero.
sort_time
- 程序设计课程设计测试三种排序算法的时间效率-Program designed to test three kinds of curriculum design, time efficiency of sorting algorithms
xianxingbiao
- 线性表的操作，包括删除，插入，提取，清空等-Linear table operations, including delete, insert, extract, empty, etc.
zju2526dijkstra
- zoj2526利用dijikstra算法解决最短路问题。-zoj2526 use dijikstra algorithm to solve shortest path problem.
1212
- 先来先服务算法，输入小于6 的进程，时间-FCFS algorithm
Huffman
- 构造哈夫曼树的c++实现代码，非常基础易懂，适合初学者学习。-Huffman tree structure to achieve the c++ code, very basic and easy to understand, suitable for beginners to learn.
dictionary-tree-soursecode
- 此代码是字典树的实现源代码，字典树是一种数据结构，用它可以实现对各种单词的检索。而对每一个单词的查找次数是单词的长度。做acm题很有用，应用程序中相信也能优化很多算法！
search
- 比较binary search和sequential search两种算法-hope it helps
hfm
- 哈夫曼树 用于寻找二叉树中寻找最短的路径问题-Huffman binary tree is used to find the shortest path problem to find
1
- 离散数学代数系统,详细的代码实现，以及不错的算法-Discrete Mathematics algebra system, a detailed code, and good algorithms
hang
- 行编辑程序，是严蔚敏的数据结构C语言版实验的一个，我们有这个实验，其他人应该也有，能用上的。