资源列表
HuffmanTree
- 展示了赫夫曼树的建造过程，有大量注释，适合新手理解。-Shows the Huffman tree construction process, there are a lot of notes, suitable for beginners to understand.
HuffmanTree-Shortest-Path
- 赫夫曼树的建造过程，以及最短路径算法，有关键步奏的注释，需输入节点数据以及邻接矩阵的内容，注意看主函数-Huffman tree construction process, as well as the shortest path algorithm, the key step-outs comments, data and content needs input node adjacency matrix, note the main function
Minimum-Spanning-Tree
- 使用邻接矩阵生成最小生成树的算法，须输入顶点数目，顶点数据以及邻接矩阵的数据。-Adjacency matrix generated minimum spanning tree algorithm, the input data must be the number of vertices, vertex data and adjacency matrix.
起泡排序
- 运用c语言编写程序比较数据的大小。起泡法一种经典的比较大小的方法。
Binary
- 二叉树的创建，打印并且返回高度以及元素所在高度-Binary tree create, print and return the height and the height of the element at which
shujujiegou
- 常见数据结构算法，包括多项式计算，二叉树遍历，链表，图的搜索等-Common data structure algorithms, including polynomial, binary tree traversal, linked lists, graph search, etc.
tetris
- 文件中包含了俄罗斯方块的实现程序，编程语言C++，可以实现简单的游戏体验-File contains Tetris implementation procedures, programming languages C++, can achieve a simple game experience
哈希表
- 建立一个哈希表，实现哈希表的建立，插入，查找等功能。c++实现
2chashu_bianli
- 该功能主要用vc++实现。实现二叉树的遍历算法。遍历的方法是先序遍历。-the funcontioin of the program is find a point in the tree in the struture of data .and then the method of it is LF.
05_RBT
- 红黑树的创建插入与删除的具体源代码的实现-Achieve red-black tree create insertion and deletion of specific implementation code
graph_dfs
- 图的深度优先遍历算法程序。代码已经将图的深度以及每一层的节点写固定了。可以自己进去修改。-the program is the dfs of tree.the point of the tree and the layer of it has been fix.you can change it as you want.
BFS_graph
- 这是数据结构中图的广度优先算法的实现。广度优先算法是按照每个节点的拥有的孩子数目来进行遍历的。而不像图的深度优先算法是按照深层次，然后如果不能继续进入更深一层，就往回遍历。-BFS program of tree have a large of difference of the DFS program of trees.The produre of it is with the method of the children of a point ,rather than the depth o