资源列表
report+of+Algorithm
- 算法设计的实验报告 包括Bottom-Up Merge Sorting算法、插入排序算法Heaps的创建堆、堆排序算法、按秩合并算法以及带路径压缩算法、实现查找第K小元素算法、实现快速排序算法、实现平面内最接近点对算法、实现最长公共子序列算法、实现矩阵链相乘算法、实现0/1背包问题算法、实现Dijistra’s算法、Prim算法、Kruskal算法、文件压缩算法-Experimental Algorithm Design Report including Bottom-Up Merge So
C
- 数据结构课程设计报告,虽然好多地方都有，我这个是按老师要求做好的，加个封面就可以直接上交。 -Data structure course design report, although a lot of places, I this is based on the teacher asked to do a good job, and add the cover can be directly handed over.
StrongConnectedComponent
- 计算强连通分支的算法实现，从原图中得到强连通分支图并输出-Calculation of strongly connected branching algorithm, from the artwork to be strongly connected cladogram and output
shujujiegou
- 数据结构的4个算法的描述和方法的解释 可以用于学习参考和相关类容的下载和学习-Data structure of the four algorithms to describe and explain the methods can be used for reference and related learning capacity of the download and learning
TREE
- 二叉树的实现，包括前序、中序、后序和层次遍历，输出，计算叶子节点等函数。-Binary tree realization, including the former sequence, in order, after the traversal sequence and levels of output, computing functions, such as leaf nodes.
operate
- 10以内数的四则运算表达式求值。利用堆栈的后进先出实现当运算符优先级较低的时候对操作数和运算符的出栈进行运算。-10 less than the number four operator expression is evaluated. The use of LIFO stack to achieve when the operator when a lower priority on the operand and operator of a stack to carry out comput
77433668CXDD
- 数据结构中实验的车厢调度源码希望对大家有用-Data structure in the experiment compartment scheduling for all of us hope that a useful source
yuesefu
- 在网上找的约瑟夫环大家一起参考-Online to find Ring of Joseph together reference
_Queen
- 非递归实现N皇后问题求解，输出全部求解的集合。-Non-recursive realization of N Queen s problem solving, solving a collection of all output.
source
- 7.安排教学计划（**） 问题描述：大学的每个专业都要制定教学计划。假设任何专业都有固定的学习年限，每学年含两个学期，每学期的时间长度和学分上限值均相等。每个专业开设的课程都是确定的，而且课程在开设时间的安排上必须满足先修关系。每门课程有哪些先修课程是确定的，可以有任意多门，也可以没有。每门课程恰好占一个学期。试在这样的前提下设计一个教学计划编制程序。 基本要求：输入参数包括学期总数，一学期的学分上限，每门课程的课程号、学分和直接先修课的课程号；允许两种策略，一是使学生在各学
bessalfansuan
- 白赛尔大地主题结算，反算代码，自己编的。-Purcell clearing land of the theme of white, anti-counting code, its own series.
2
- 集合运算器 数据结构问题 可实现叫、并、差集。判断元素、子集，输出补集-Data collection of computing structural problems can be called, and, difference sets. Determine the elements, a subset of the output set up