资源列表
Leasen图的建立和DFS&BFS算法
- 数据结构中关于DFS和BFS的练习,较简单的实现了二叉树的DFS和BFS搜索-data structure of DFS and BFS practice, the realization of a simple binary tree search DFS and the BFS
实例116 多点曲线光滑拟和
- 基于离散多点的曲线拟合 把多个离散点拟合成曲线-based on discrete multiple points of curve fitting from multiple discrete points to the composite curve
FIFO与LRU 算法实现(java)
- java编的两种算法,word写的,看不懂,大家帮忙-java series of the two algorithms, write the word, fail to understand, we look at the help
LRU算法的自编c++实现及源码。
- 实现LRU算法的C++版,word环境下写的,c++环境下运行-LRU algorithm to achieve the C version, word environment written in the running environment c
用C语言实现最近最久未使用(LRU)置换算法
- c语言编的LRU置换算法,word文档格式-series of the LRU algorithm replacement, word document formats
数值分析算法与说明文档
- 这是我数值分析课程的实习题目的源代码(并附有文档),文档包括对问题进行了描述,并对结果进行分析,希望对大家有所帮助.-numerical analysis courses internship topic source code (together with documentation), including documentation of the problem described, and results analysis, we hope to help.
先序建立树
- 数据结构中,先序建立二叉树算法,在建树的基础上可以进行树的其他操作,思想简单易懂-data structure, the first order to establish a binary tree algorithm, the contribution on the basis of the tree can be conducted in other operations, thinking simple and understandable
层次非递归遍历
- 数据结构中的常见算法,树的层次非递归遍历序算法,简单易懂-data structure of the common algorithm, the level of tree traversal sequence non - recursive algorithm, simple
中序遍历
- s数据机构中的常出算法,建树后实现中序遍历,从而实现其他的转化-s data agencies of the algorithm regular contribution to realization after the preorder, thereby realizing the transformation of other
树的建立及其深度
- 树结构是数据结构中最重要的结构。利用树可以实现遍历等要求。该算法用于建立树,才能实现其他的操作-tree data structure is the most important structure. Using tree traversal can be achieved, among others. The algorithm for the creation of the tree can be achieved by other operators
Prim算法构造最小生成树
- 数据结构中的prim算法构造最小树的算法。课程作业要求-data structure constructed Prim algorithm of most trees algorithms. Courses operational requirements
formulervalue
- 数据结构中的表达式求值运算算法实现。数据结构课的要求。-data structure of the expression evaluates computing algorithm. Course data structure requirements.
