资源列表
LDCP
- a)Refer to the LDPC presentation slides provided, and use the input data provided below to decode the codeword Repeat a) with new matrix H, codeword and σ^2 given below-a) Refer to the LDPC presentation slides provided, and use the input data provi
maze
- 数据结构课程设计——迷宫问题求解代码（已测试，可直接运行）-Curriculum design- maze problem solving code (already tested, can be directly run)
matrix
- It has basically all kind of matrix operation. the program is written in cpp. it has gaussian elimination process also which will no be easily found in internet. with matrix multiplcation and its inverse.
queue
- 队列的链式存储结构与操作，数据结构算法，简单易懂-Chain store queue structure and operations, data structure algorithms, easy to understand
queue2
- 队列的顺序存储结构与操作,算法简单清晰，欢迎下载-Sequential storage structure and operation of the queue, the algorithm is simple and clear
BiTree
- 二叉树的非递归前中后层序输出，代码原创，转载请说明-After the former non-recursive binary sequence output, the code original, reproduced please indicate
tree
- 二叉树根结点到某点路径，算法简单清晰，方便acm同学-Binary tree root to a certain point on the path, the algorithm is simple and clear, easy acm students
stack1
- 栈的链式存储结构与操作，栈的基本操作，可以ac过-The basic structure and operation of the chain store operations, stack stack can be ac over
stack2
- 栈的顺序存储结构与操作，简单的算法，清晰，可以ac过-The stack order of the storage structure and operation, a simple algorithm, clear, too can ac
ds_3_5
- 本程序定义了一个wordstack类，可以储存字符串。 在pop字符串时候能够正确pop。 先将文件进行分析，对需要压入堆栈的字符串压入堆栈，然后进行判断。 可更改第20行中的test.txt为test2.txt和text3.txt测试其他结果-The program defines a wordstack class, you can store strings. In the pop strings when correctly pop. First file for an
ds_6_8
- 数据结构优先级序列 Priority sequence data structure-Priority sequence data structures Priority sequence data structure
ds_5_8
- 此处可输入以下树来进行调试。 构建的树为 1 / | 2 3 4 / | \ 5 6 7 B | / 8 9 A 前序遍历:1 2 5 6 8 7 9 A 3 4 B 后序遍历:5 8 6 9 A 7 2 3 B 4 1 层次遍历:1 2 3 4 5 6 7 B 8 9 A-Here you can enter the following tree for debugging. Construction of the tree 1/| \ 2 3 4/|