资源列表
四则运算实现
- 四则运算实现，这个算法是用C语言实现的，算法程序代码明确易懂。-four Operators realize that this algorithm is used to achieve the C language, the algorithm code clear and understandable.
约瑟夫环的循环链表实现
- 约瑟夫环的循环链表实现，这个程序比较完整，有需要做试验的请速速下载。-Josephus cycle Chain achieved, the procedure is complete, the pilot needs to be done urgently requested to download.
含并、交和差运算的集合类型试验报告
- 含并、交和差运算的集合类型试验报告，这个报告是做计算机试验的标准样式，分为了7个模块。-containing, intersection and poor computing pool type test report, the report is made to the standard computer test pattern, divided into seven modules.
图的深度优先周游_递归_邻接矩阵
- 图的深度优先算法，这个算法非常的实用，应该经常被用到-map the depth priority algorithm, the algorithm is very practical, should always be used
isTree
- 一个生成树的源程序，不是很复杂，不过用来交一下数据结构的作业还行吧-a spanning tree of the source, is not very complicated, but what used to pay the operating data structure it is also OK
经典约瑟夫环问题c语言版
- 数据结构中解决约瑟夫环问题的代码，里面只有源代码，大家用TC2编译一下就可以用了：）。-data structure to solve the problem of Josephus code, only the source code, we use TC2 compiler can use it with a :).
JTreeDemo
- 森林状的关系图，用java实现的森林状的关系图-forest from the map, using java for the forest-like diagram
match(man&women)
- 回溯法 解决男女匹配问题 八男八女匹配-Backtracking address gender matching eight men and eight women match
Matrix111
- 矩阵连乘问题 对多个矩阵连乘时 的消耗进行分析-matrix continually multiply problems for a number of matrix continually multiply the consumption analysis
salesman-temp
- 货郎担 最短路径问题 用链表储存最短路径节点-traveling salesman problem using the shortest path Listless storage nodes Shortest Path
longint1111
- 任意长整数相加问题 任意输入两个任意长的整数进行相加 可以得出正确结果，-arbitrary sum of long integer problem indiscriminate importation of two arbitrarily long integer can be drawn together for the right result,
BDFS
- 用邻接表表示无向图的深度优先搜索遍历 有助于大家理解图的优先遍历问题-adjoining table with no plans to the depth-first search traverse help you understand the plans of the priority issues Traversing