资源列表
DFS-BFS
- 2014年北京大学暑假公开课算法讲解课件之搜索，讲解详细，分析透彻-2014 Peking University summer open class algorithm courseware on the graph theory, explain the detailed, thorough analysis
Graph-theory
- 2014年北京大学暑假公开课算法讲解课件之图论，讲解详细，分析透彻-2014 Peking University summer open class algorithm courseware on the graph theory, explain the detailed, thorough analysis
25_CS11B019_Assignment3.tar
- infix expression to post fix
TA
- Template And File In C-Template And File In C++
List-of-ordered-a-merger
- 列表下令合并两个非递减合并成一个非增列表的列表中，以数据结构的知识以实现。-List ordered merger of the two non-decreasing merged into a non-increasing list of lists, with the knowledge of data structures to achieve.
code
- 在C语言下，实现1维码的生成，纯C编写，带注释，-In the C language, the realization of 1 dimensional code, written in pure C, with notes,
avl
- 用户输入N，得到依次插入1到N的数字所形成的AVL树的两种遍历结果。-AVL TREE
graph
- 使用C++语言编写，实现了图的深度遍历的算法-Use C++ language, realize the depth graph traversal algorithms
e1_p1
- 对于给定的整数N，设计算法求出（0，N]区间内所有满足x^2+y^2=z^2的所有正整数三元有序数组，并将结果写入文件中。-For a given integer N, design algorithm and the (0, N] range all meet x ^ 2+ y ^ 2 = z ^ 2 all positive integer ternary orderly array, and writes the result to a file.
2010011016_e3_p1
- 表达式求值：给定一个浮点数混合运算的中缀表达式，分别实现转换成为后 缀表达式，然后求值；和直接对中缀表达式求值两种求值算法，并通过对给定测 试集的实验，比较两种算法的效率差异并进行分析。 -Expression uation: given a mixture of floating point calculation of infix expression, respectively after converted into
2010011016_e4_p1
- 编写五个函数，实现对二叉树的插入、复制、删除、非递归中序遍历和层序遍历操作，理解和掌握链式存储二叉树的性质和操作方法，同时进一步熟悉指针操作。-Write five functions to achieve the insertion of binary tree, copy, delete, and non-recursive preorder traversal sequence operations, understand and grasp the nature and operatio
2010011016_e5_p1
- 用图的相关算法，解决清华园旅游问题，包括计算游览完不包括教学楼的所有景点需要的次数，找出最长的最短路径最小的点，计算铺设能到达所有景点的光纤的最小长度及路径。通过实验掌握图的表示方法和算法。-With related algorithms map, solve Tsinghua tourism issues, including the calculation does not include the number of times after visiting all the attracti