资源列表
shujujiegou
- 该数据结构代码包括单链表的简单应用，包括寻找最短路径或是对图进行不同的遍历等。-Code the data structure including a single list of simple applications, including the search for the shortest path or on the map such as different traversal.
Elevator
- 数据结构 关于5层电梯的模拟 希望对学习数据结构的同学们有一点帮助-Data structure on the 5-story elevator Simulation data structures want to learn a little of the students to help
yuesefuhuan
- 通过链表的插入和删除实现约瑟夫环,熟练掌握数据结构的基础内容.-Through the linked list insertion and deletion of the achievement of Joseph Wan, the master data structure based on content.
Stack
- 堆栈的初始化,判空,元素入栈,出站等基本操作以熟练掌握数据结构基本内容.-Stack initialization, contractors air,入栈elements, the basic operation of the station in order to master the basic content of the data structure.
BinTree
- 创建二叉树,然后先序,中序,后序遍历二叉树中的各元素.-Create a binary tree, and then the first order, in sequence, after the tree traversal of the element.
zhongxubianli
- 中序遍历源代码，方便查询，可以自行更改，逻辑性强-Ergodic source code in order to facilitate inquiries, you can make changes
BigNumber
- 直接引入 可以像int一样操作 跟Java里的好像 但好用多了 而且是加速版的，比用字符串写的还快(用vector<int>) 还附了些奇怪的函式 有兴趣自己写BigNumber的人可以参考看看 -Can be directly introduced to operate with the same as int in Java but it seems the more useful it is to speed up version of, than to
eigthnum
- 宽度优先搜索算法八数码问题代码： 把起始节点放到OPEN表中(如果该起始节点为一目标节点，则求得一个解答）-Breadth-first search algorithm eight issues digital code: the start node on OPEN table (if the start node as a target node, then find an answer)
ADT
- 抽象数据类型复数的实现,需构建复数的表示形式，复数的输出，以及复数的加法、乘法和减法。-Abstract data type of the realization of the plural, the plural of that required to build the form, the output of the plural and the plural of the adder, multiplication and subtraction.
hash
- 查找： 建立一个哈希查找表，哈希函数采用: H(key)= key P(其中P=13)，若发生冲突后,用链地址法解决冲突。-Search: the creation of a hash lookup table, the use of hash function: H (key) = key P (of which P = 13), if the occurrence of post-conflict, and conflict resolution chain address law.
graph
- 图： 调试图的邻接链表存储的程序，解决下列问题： 根据教科书P157页的G2图（无向图），输入数据运行程序；再适当修改程序使它适用于G1图（有向图），输入数据运行程序。-Adjacency list graph debug stored procedures, to address the following issues: According to the textbook page G2 Fig P157 (undirected graph), input data to run pro
tree
- 给定一组值，建立一棵二叉树，求二叉数的树深。-Given a set of values, the establishment of a binary tree, and the number of binary trees deep.