资源列表
Dormitory-management-software
- 软件工程学院实用宿舍管理系统开发系统源代码，实用与完成数据结构课程设计大作业-Software engineering college dormitory management system development system practical source code, and the practical with complete data structure course design project
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
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
Huffman_2
- 对输入的一串电文字符实现赫夫曼编码，再对赫夫曼编码生成的代码进行译码，输出电文字符串。要实现赫夫曼树德算法，首先要实现在HT[1.k]中选择parent为0且权值最小的两个根结点的选择算法；另外，还要一个实现统计输入电文字符串中各种字符出现的频率以及字符的种类的算法。假设电文中仅含有大写字母。-For the entry of a string of message character realize hoffman (coding, again to hoffman (code generat
Huffman_1
- 对输入的一串电文字符实现赫夫曼编码，再对赫夫曼编码生成的代码进行译码，输出电文字符串。-For the entry of a string of message character realize hoffman (coding, again to hoffman (code generated code decode, output message strings.
List-of-application
- 数据结构课程设计 链表应用应用链表实现对数据的插入，删除，查找，排序。-A student achievement management system, uses linked list for data inserting, deleting, sorting and querying, C-C.
Huffman
- 哈夫曼树的编写,程序语言为C语言，数据结构与算法范畴。-Huffman written by C progamming language，Data structure and algorithm
main
- 重言式判断的学习代码，利用栈，队列，树来解决问题-Tautology type of judgment to learn code, stacks, queues, trees to solve the problem
3
- 对所给出的城市路口、道路信息，分别用Dijkstra 算法和Floyd算法，求出两两之间的最短距离和路径，结果输出到文件，每行一组最短路径，其格式为逗号分割的信息，分别为起点、终点、最短距离、中间依次经过的路口编号，各行按照起点编号、终点编号从小到大排序，只输出起点编号小于终点编号的部分。 -Information given city intersection, road, Dijkstra algorithm and Floyd algorithm to calculate the sh
Cpp1
- 算法分析，回溯法原理及基本实现，实现基本逻辑，完成主要功能-Algorithm analysis and backtracking principle and the basic realization of basic logic to complete the main function
BranchAndBoundMethod
- 分支与界法的算法，结合一些具体的例子，可以直接输出结果-Branch and bound method, algorithm, combined with some specific examples
kmp_test
- 实现KMP算法，输入三组主串S和模式串P，输出模式串的Next(j)函数值，以及该P在S中的位置的定位函数值，即序号值。其中S的长度为15~25,P的长度为5~8。-KMP algorithm, enter the three main string S and pattern string P output mode string Next (j) The function value, as well as the P position in the S orientation funct