资源列表
test2
- 利用堆栈的形式对Huffman编码算法进行编程，编码过程还是比较高效的(Huffman encoding algorithm using the form of the stack programming, the encoding process is more efficient)
堆栈
- c语言中对于堆栈的理解并且对常出现的错误进行剖析，便于与开发者理解(The understanding of the stack in the C language and the analysis of the frequently occurring errors are easy to understand with the developers.)
22
- 数据结构题目：使用邻接表存储实现拓扑排序(Topological sorting by adjacency table)
BiTR
- 生成一棵以二叉链表存储的二叉树bt（不少于15个结点）。 2） 分别用递归和非递归方法前序遍历bt，并以缩格形式打印bt上各结点的信息。 3） 编写算法，交换bt上所有结点的左、右子树，并以缩格形式打印出交换前后的bt结点信息。(Generate a two fork tree BT (no less than 15 nodes) stored with a two chain list. 2) the BT is traversed with the preorder of recursive
简易计算器
- 实现四则运算和三角函数运算功能的自制简易计算器(Implementation of four operations and trigonometric functions)
实验二
- 以一个mXn的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一 个程序，对任意设定的额迷宫，求出一条从入口到出口的通路，或得出没有通路的结论。(The maze is represented by a mXn's rectangular array, and 0 and 1 represent the paths and obstacles in the maze, respectively. A program is designed for an arbitrarily set ma
NQueens.m
- N皇后问题 用Matlab解决 N皇后问题 用Matlab解决(NQteens use Matlab)
邻接矩阵与邻接表相互转化
- 数据结构图论部分，邻接矩阵转邻接表，用C语言实现，再加几个字才够20字(The data structure graph, adjacency matrix to the adjacency list, using C language, plus a few words to 20 words)
HuffmanCode
- 哈夫曼树编码,数据结构c语言版，哈夫曼树的编码程序，通过不同的权值获得不同的编码，值得参考(The program for the Huffman coding process, more detailed, the annotation is more, hope someone communicate with me!)
图的遍历
- 图的构建以及实现图的深度遍历和广度遍历!!!!!!!!(tudegoujianyijishixiantudeshendubianliheguangdubianli)
二叉树
- 实现了二叉树的创建，先序遍历，中序遍历，后序遍历以及二叉树的竖式打印(binary tree traverse)
DFS
- 通过文件中的信息，进行搜索可达路径，行走过的正确路径标记为1，错误的路径标记为2(Through the information in the file, the search reachable path is searched, the correct path to walk is marked as 1, and the wrong path is marked 2)