资源列表
Huffman_2
- 对输入的一串电文字符实现赫夫曼编码，再对赫夫曼编码生成的代码进行译码，输出电文字符串。要实现赫夫曼树德算法，首先要实现在HT[1.k]中选择parent为0且权值最小的两个根结点的选择算法；另外，还要一个实现统计输入电文字符串中各种字符出现的频率以及字符的种类的算法。假设电文中仅含有大写字母。-For the entry of a string of message character realize hoffman (coding, again to hoffman (code generat
test23
- 用顺序存储实现栈的初始化、入栈、出栈、取栈顶、判栈空操作。调用以上操作实现判断从键盘输入的括号序列是否匹配。-Stored in order to achieve the initialization of the stack, stack, stack, take the top of the stack and sentenced to the operation of the stack is empty. Call operation to achieve more than the j
text
- 用顺序存储实现栈的初始化、入栈、出栈、取栈顶、判栈空操作。调用以上操作实现判断从键盘输入的括号序列是否匹配。-Stored in order to achieve the initialization of the stack, stack, stack, take the top of the stack and sentenced to the operation of the stack is empty. Call operation to achieve more than the j
Dormitory-management-software
- 软件工程学院实用宿舍管理系统开发系统源代码，实用与完成数据结构课程设计大作业-Software engineering college dormitory management system development system practical source code, and the practical with complete data structure course design project
2010012010036First_Sort
- 快速排序 希尔排序 c++ 工程 利用快速排序和希尔排序的c++工程 文件输入及输出-c++ shell quick——sort
aa-
- 数据结构：图的建立、深度优先遍历及广度优先遍历C++代码（个人优化）-Data structures: the establishment of the graph, depth-first traversal and breadth first the traversal C++ code (individual optimization)
Automatically-generate-a-maze
- C语言之180行“随机迷宫”代码详解与分析之整理版-Automatically generate a maze
Visual_Path_Finding_SrcaDemo
- C# - Visualizing Path Finding With Dijkstra, AStar, Bi-directional Dijkstra s, and Bi-directional A* Algorithms
datastructure
- 实现一个内存分配模拟系统，分配的原则参见“伙伴系统”。 要点：使用链表保存各块内存信息，同一个链表中保存的各块大小相同。 链表中的每个结点形式如下： 从键盘输入欲分配的块的大小，系统给出分配结果，并在屏幕上显示出来（图示方式或文本方式）。 -A memory allocation simulation system, the principle of allocation see the " buddy system" . Po
binary-tree
- 根据二叉树的中序遍历、后序遍历、前序遍历恢复二叉树-According to the binary tree in preorder traversal, postorder traversal, preorder traversal to restore binary tree
bahuanghouwenti
- 八皇后问题，实现相应功能，代码正确、希望可以帮到需要的人-Eight queens problem
erchashu
- 二叉树和平衡二叉树问题。实现一定的功能，能够正确运行-Binary trees and balanced binary tree. To achieve a certain function to work correctly