资源列表
huffman
- 利用哈夫曼编码进行通信可以大大提高信道的利用率，缩短信息传输的时间，降低传输成本。但是这要求发送端通过一个编码系统对待传数据预先编码，在接收端传来的数据进行译码。对于双工信道，每端都需要有一个完整的编／译码系统，试为这样的信息收发站编写一个哈夫曼的编／译码系统。-huffman tree algorithm
spareMatrix
- 三元组稀疏矩阵的加法和减法以及乘法的实现-Sparse matrix triple the addition and subtraction, and multiplication of the realization of
CommonOrder
- 用动态规划的方法找出两个序列的最长公共子序列，C++，包含有完整文档说明。-Dynamic programming methods used to identify two of the longest sequence of public sub-sequence, C++, contains the full documentation.
shuju6
- 熟悉二叉树的各种存储结构的特点及适用范围；掌握建立二叉树的存储结构的方法；熟练掌握二叉树的前序、中序、后序遍历的递归及非递归算法；灵活运用递归的遍历算法实现二叉树的其它各种运算-Familiar with the binary tree structure of a variety of storage features and the scope of application acquire storage to establish the structure of binary tree
shuju7
- 灵活运用非递归的遍历算法实现二叉树的其它各种运算；掌握按层次顺序遍历二叉树的方法；熟练掌握在中序线索二叉树上找给定结点的指定顺序下的前驱和后继的方法。-Flexibility in the use of non-recursive binary tree traversal algorithm to achieve a variety of other operations master-level order according to the method of binary tree tr
datastructure
- Datastructure: Linked Lists Stack and Queue Multi-lists Linked Structures Trees Binary Tree Searching and Sorting AVL Tree Red-Black Tree
SpringerSystemVerilogforDesign2ndEdition
- Verilog VHDL code introdution to verilog
LINK3
- A small program about finding weekday
Dfs
- CREATE GRAPH WITH NEW TECHNOLOGY OF DRAWING
Cprogram900
- 这个里面有严蔚敏老师c数据结构经典900例子，着实经典适用于研考人士-That there are strict teacher c Wei-Min 900 classic example of data structure, really classic for Research, Development and Evaluation to
Dijkstra
- 经典的dijkstra求最短路径算法，采用VC++编写-The dijkstra for the classic shortest path algorithm, using VC++ to prepare
Dynamicarrays
- ……^PP^动态数组创建……^pp^Dynamic arrays-Dynamic arrays