资源列表
concurrent-data-structures.pdf.tar
- Concurrent data structures.
Code
- 常用算法程序集相关源码，如随机数、矩阵运算-Related Items commonly used algorithm for assembly, such as a random number, matrix operations
zhebanchazhao
- 用c++实现的折半查找算法，简单明了-C++ binary search algorithm is simple.
migong
- 数据结构课程设计报告及代码 C语言环境 迷宫问题的设计 -Data structure curriculum design reports and code C language environment maze design issues
Qeuing-simulation-sysem
- queuing simulation system theory and the solution for some problem that will stop you for bullding-queuing simulation system theory and the solution for some problem that will stop you for bullding
MPI_ug_in_FORTRAN.pdf
- This a manual for message passing interace for writing paralll program to run of supercomputers and is very easy to follow-This is a manual for message passing interace for writing paralll program to run of supercomputers and is very easy to follow
DP
- 随着动态规划在 OI 中的广泛运用，动态规划问题已经不再停滞于能够写出 方程就能得到完美解答。如今考察我们的对于动态规划的运用往往是考察动态规 划的优化，也就是降维。我们已经知道维护方程中的决策可以选择用数据结构进 行优化，比如：Splay、线段树，等等。这样的优化仅能将方程的时间复杂度下 降一个 LogN 的级别。如果 N 的范围相当大，即使下降一个 LogN 的级别也依然 超时呢？我们引进一种更强的优化——斜率优化。-With the extensive use of d
fenzhixianjie
- 用分支限界法求解旅行商问题，用Ｃ＋＋语言编程实现
sparsematrix
- 数据结构，实现稀疏矩阵输入和“一次定位快速转置”。-Data structure, to achieve sparse matrix input and " a rapid positioning transpose."
hftree
- 哈夫曼树 c++实现 哈夫曼树(Huffman Tree) 假设有n个权值{ W1，W2，…，W n }，试构造有n个叶子结点的二叉树，每个叶子结点拥有一个权值W ，则其中带权路径长度WPL 最小的二叉树，称为最优二叉树或哈夫曼树。-C++ Huffman tree Huffman tree (Huffman Tree) Suppose there are n weights {W1, W2, ..., W n}, the test structure has n leaf nodes of t
The-bankers-algorithm
- 银行家算法的课程设计，内容非常详细，流程图，算法描述，源代码都在里面，连心得体会都有哦-The banker s algorithm
DSFGraphaprim-MST
- 深度优先遍历图，并用kruscal算法求最小生成树-Depth-first traversal map, and for the Minimum Spanning Tree with kruscal