资源列表
SSD5 exam1
- 保证对
KnightTraversal
- 骑士遍历程序，以栈实现，觉得写得还算效率挺高的-Knight traversal process to stack implementation, thought that it was fairly pricey for efficiency
mini_prio_queue
- 最小优先队列的c++模板实现，如果是自定义类型则需要重载<运算符。
Node
- 节点类，提供了全套节点相关处理函数-category nodes, providing a complete set of nodes Functions
yuesefuhuan
- 数据结构实习题作业，用C语言编写约瑟夫环。-Practical problems data structure operations, written by Joseph C ring.
Ha-Fuman-tree
- 哈弗曼树编码，实现树倒叶子节点的权值最下，用于编码和求最值-Ha Fuman tree coding, to achieve the right of the tree down the value of the leaf nodes under the code and find the best value for
Dijkstra
- 在C环境中使用Dijkstra算法解决网络图中两点间最短路径。-Between two points in the network graph shortest path.
nHuangHou
- 队列式分支界限法实现的n皇后问题，采用文件的方式输入输出-Queue-type branch and bound method to achieve the n-queens problem, using the method of file input and output
bpsk_2
- bpsk信号进行fft快速算法，矩阵处理SVD分解-bpsk signal fft fast algorithm, SVD decomposition
danyuan
- 单源最短路径问题的动态规划算法,请大家多多指教-single source shortest path problem of dynamic programming algorithm, please exhibitions
seed_fill
- 此代码给出了四邻域与八邻域的种子填充数据结构函数源码-Change the code gives the neighbors field and eight neighborhood filled with data structure functions of seed source
Traversingbinarytreefinddeleteupdatedatasource
- 二叉树的遍历、查找、删除、更新数据的代码-Traversing binary tree, find, delete, update data source