资源列表
mini_prio_queue
- 最小优先队列的c++模板实现，如果是自定义类型则需要重载<运算符。
Node
- 节点类，提供了全套节点相关处理函数-category nodes, providing a complete set of nodes Functions
1
- 2006年全国大学生数学建模参赛程序 第三题（1）-2006 Mathematical Contest in Modeling procedure title entries (1)
fenshu
- 分数类，就是包含分数和整数，分数和分数之间的加，减，乘，除-Scores of classes, that contains the scores and integers, between the scores and scores of add, subtract, multiply, divide
SIS_PSO
- 具备求解大规模复杂函数问题的粒子群优化算法源程序-a PSO algorithm that can solve large scale complex problem.
chengxugaizheng
- 对于初学者易错之处进行点出,方便初学者学习.-Place for beginners prone to point out, easy for beginners to learn.
xiaoxueshengshuxuelianxi
- 随机出10道题（加法、减法、乘法、除法），由学生解答，10道完成后给出成绩及评语。要求加法、减法、乘法、除法各设计一个函数。参数为两个数据，返回解答结果（对为1，错为0）。-Random out of 10 questions (addition, subtraction, multiplication, division), by students to answer, given after completion of 10 grades and comments. Requires add
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