资源列表
EPROCESS
- 基于EPROCESS结构中双向链表的进程检测方法-EPROCESS structure based on two-way linked list in the process of detection methods
nplvci
- Classic edge detection algorithm Sobel matlab source
tree
- 定义二叉树的链式存储结构，实现下列各类应用的递归算法。 （1）构建一棵二叉树，以某种形式（括号表示法、树形表示法、凹入表示法等）输出二叉树，最后释放二叉树的存储内存。 （2）分别编写程序实现：将二叉树的顺序存储结构转换成链式存储结构；将二叉树的链式存储结构转换为顺序存储结构。 （3）实现二叉树的先序、中序、后序和层次序遍历算法。输出二叉树的叶子节点。 （4）分别计算二叉树的所有节点个数，度为0、1、2的节点个数。 （5）统计二叉树中值为k的节点个数。计算二叉树中节点最小的值。 （6）计算二叉树的
yiwei
- 移位寄存器的小程序，程序不长，自己写的。如果有不完善的地方，望批评指正。-Shift register of small program, and the program is not long, wrote. If there is no perfect place, hope criticism and corrections.
namespace
- c语言，一元多项式一定要包含系数项和指数项的描述，在选择合理的数据结构基础上完成多项式的建立、销毁、输出和加减法操作。-c language, a polynomial coefficient must contain a descr iption of items and index entries, the choice of rational polynomial data structure based on the completion of the establishment, de
baiTap1
- Operations basic in matlab
juzhenliancheng
- 计算矩阵链乘的动态优化问题，输出最佳括号匹配形式，以及最少的链乘次数。-Calculation of matrix-chain optimization problem by dynamic output best match the form of brackets, as well as by the least number of chains.
图的基本操作
- 实现图的各种基本操作 图的建立 删除 查找 遍历-plans to achieve the basic operation of the plan is to establish delete you traverse
josephus
- 分别以数组指针和模拟指针的方法解决约瑟夫问题-Respectively pointer array pointer and simulation methods to solve the problem of Joseph
BiTree
- 二叉树 先序遍历 中序遍历 后续遍历 构建一棵二叉树 递归算法-Preorder traversal of binary tree traversal in order to build up a binary tree traversal recursive algorithm
ChongYanPanBeiShi
- 严蔚敏《数据结构(c语言版)习题集》实习题答案,重言判别式-YanWeiMin " data structure (c language version) Problem Set" internship answer questions, tautology discriminant
jyhygjyghj
- 线索二叉树 建立中序线索二叉树，并且中序遍历 求中序线索二叉树上已知结点中序的前驱和后继；-Binary tree in order to establish clues clues tree, and in the traversal sequence for clues in the binary tree nodes on the known sequence of the precursor and follow-up