资源列表
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
meijupailiezuhe131
- T012_枚举排列组合131,关于枚举排列组合的算法-T012_ enumerate permutations 131, permutations and combinations on the enumeration algorithm
Bellman_ford
- T0041_最短路径Bellman_ford算法优化,bellman-ford优化-T0041_ Bellman_ford shortest path algorithm optimization, bellman-ford optimization
224Edmonds_Karp
- T017_最大流增广路算法224Edmonds_Karp-T017_ maximum flow augmenting path algorithm 224Edmonds_Karp
T006_Floyd_Warshal
- T006_Floyd_Warshall算法任意两点间的最短路径-T006_Floyd_Warshall algorithm shortest path between any two
zuidazuixiaofeiyongliu
- 关于T018_最小费用最大流问题的算法，求出最大流最小费用-About T018_ minimum cost maximum flow problem algorithm, find the maximum flow minimum cost
roweditor
- 实现简单的行编辑系统，打开、退出、显示、删除、添加等功能-Line editing system to achieve a simple, open, quit, display, delete, add, etc.