资源列表
jianshanfei
- 该程序实现图的建立与先深和先广遍历，图采用矩阵存储，在遍历过程中用栈实现，但若改用队列，将会实现得更自然流畅-the program plans to establish the first and the first deep-Traversal, map storage matrix, Traversing in the process of making Stack, but switch queue, there will be more natural and fluid
all_kinds_of_algorithms
- 常用算法如西尔排序 堆排序 冒泡排序 选择排序等-common algorithms such as Silvan ranking Heap Sort Bubble Sort Selection Sorting etc.
TIN10000point
- tin的生成,速度非常快.TIN10000point只用1分36秒-tin production, speed very quickly. TIN10000point only one minute and 36 seconds
bahuanghoureal
- 八皇后算法完整程序，还不错的一个。有兴趣的下下来-eight Queen's algorithm integrity procedures, but also a good one. Interested look down under
shugou
- 这是同一个数据结构的课程设计,由C++语言编写的-This is a data structure with the curriculum design, prepared by the C language
disanzan
- 这是自己编写的,严蔚敏版的数据结构第三章的部分答案-This is their preparation, Yan Wei-min version of the data structure of Chapter III Part of the answer
data_struct(C)
- C语言数据结构源代码，包括队列，栈和链表等。-C language source code for data structure, including the queue, stack and other Chain.
data_structC++
- C＋＋数据结构源代码及算法实现说明，包括链表、树、队列和栈等。-C + + source code for data structure and algorithm descr iption, including Chain, trees and Queue and stack.
tianji
- 田忌赛马问题：用动态规划问题，解决最优化问题，不错的算法哦-Tianji race issue : dynamic programming problem solving optimization problems, a good algorithm oh.
data-structrue
- 数据结构的实验报告和课程设计报告及代码。-experimental data structure report and the report of curriculum design and code.
zzx
- 这是一道大学生信息学奥林匹克竞赛的试题的解答，里面应用了特殊的控制手段来限制递归算法的递归深度，这种手段在利用递归结决问题时非常有借鉴意义。-students Informatics Olympiad answer the questions, inside a special application of the control measures to limit the recursive algorithm recursive depth, this means the use of re
fordfulkers;
- 一般的Ford-Fulkerson方法具有迭代性质，我们把顶点u和v之间的流记作f(u,v)。那么在最开始，我们对所有的u,v∈V置f(u,v)=0。在每次的迭代过程中，通过找到一条增加路径来使|f|增加。在这里，我们可以简单地认为所谓的“增加路径”就是一条可以传送比当前更多流的从源点s到汇点t的路径，一旦找到了这样的路径，我们就可以得到一个比原流数值更大的新流。重复这个过程，直到不存在增加路径为止，这就是Ford-Fulkerson方法的主要过程，