资源列表
pr01_SpaMatSMC
- 稀疏矩阵的一种实现，使用命令行测试该程序。具体内容请看代码。-An implementation of sparse matrix, using the command line to test the program. Look at the specific content of the code.
data
- 数据结构常见结构，表，队列，栈。主要用来管理存储数据和运算。-Data structures common structures, tables, queues, stacks. Mainly used to manage data storage and computing.
counting-sort
- 计数排序法的典型例子，算法设计与分析基础，第七章时空权衡的基数排序法C++实现.-Typical examples of counting sort method, algorithm design and analysis based on Chapter VII of the space-time trade-offs to achieve the radix sorting method C++
palindrome_mem
- 包含了回文还有内存分配的基本函数，源码内含注释，可供读者理解。-Also contains a palindrome basic memory allocation functions, source code containing notes, for readers to understand.
Josephus
- Josephus问题：设n个人围坐在一个圆桌周围，从第s个人开始数数，数到m的人，让他出局，然后从出局的人的下一个人开始重新开始数数，数到m的人，再让他出局，……，知道全部出局为止-Josephus problem: Let n individuals sitting at a round table, from the first s personal began to count, count to m, let him out, then the next person out of th
FreeTree
- 无环连通图G=(V, E)亦称为自由树T，其直径是树中所有顶点之间最短路径的最大值，设计一个算法求T的直径-Acyclic connected graph G = (V, E) is also known as free tree T, whose diameter is the tree of shortest paths between all vertices maximum design an algorithm for the diameter of T
Joseph
- 约瑟夫环的数组实现 编号为1，2，3......，n的人按顺时针方向围坐一圈，每人持有一个密码，一开始任选一个正整数作为报数上限m，从第一个人开始按顺时针方向自一开始报数，报到m时停止，报m的人出列，将他的密码作为新的m值，从他的顺时针方向上的下一个人重新从1报数，如此下去，直到所有人出列-Josephus arrays and structures to achieve
Data-structure-STL
- 数据结构与STL很全的程序例子，且分好了章节，好不容易才找到的，共享给大家，对学习数据结构应该很有帮助。-Data Structures and STL is the whole program examples, and divided the chapters, this really is a good thing, very helpful for learning.
ss
- 蜂群算法，描述了侦查蜂，雇佣蜂，围观蜂是怎样合作的过程，编译可以通过。-Colony algorithm, described the investigation bee, employment bee, bee onlookers how the process of cooperation, the compiler can pass.
code_list
- 有关链表的几个模板类，link list seque list-For several template class list
code_queue_stack
- C++ 队和栈的模板类，用几种方式实现，queuea And Stack-C++ team and stack template class
Bellman_ford
- T004_最短路径Bellman_ford算法-T004_ Bellman_ford shortest path algorithm