资源列表
Bellman-ford
- 单源最短路径,bellman_ford算法,邻接阵形式,复杂度O(n^3)-Single-source shortest path, bellman_ford algorithm, adjacency matrix form, the complexity of O (n ^ 3)
ijkstra_binary_heap
- 单源最短路径,dijkstra算法+二分堆,邻接表形式,复杂度O(mlogm)-Single-source shortest path, dijkstra algorithm+ 2 sub-heap, adjacency list form, complexity of O (mlogm)
dijkstra_mapped_heap
- 单源最短路径,dijkstra算法+映射二分堆,正向表形式,复杂度O(mlogn)-Single-source shortest path, dijkstra algorithm+ Mapping 2 points heap, positive list system, complexity of O (mlogn)
graham
- 构造凸包接口函数,传入原始点集大小n,点集p(p原有顺序被打乱!),返回凸包大小,凸包的点在convex中-Construct convex hull interface function, introduced the original point set size n, the point set p (p the original order has been disrupted!), Returns the size of the convex hull, convex hull of
friend_enemy
- 带路径压缩的并查集扩展形式,用于动态维护查询friend-enemy型等价类,维护和查询复杂度略大于O(1)-With path compression and expansion of the form of search set for the dynamic maintenance queries friend-enemy type of equivalence classes, maintain, and query complexity, slightly larger than O
mapped
- 映射二分堆 可插入,获取并删除任意元素,复杂度均O(logn) 插入时提供一个索引值,删除时按该索引删除,获取并删除最小元素时一起获得该索引 索引值范围0..MAXN-1,不能重复,不负责维护索引的唯一性,不在此返回请另外映射 主要用于图论算法,该索引值可以是节点的下标 //可更改元素类型,修改比较符号或换成比较函数-Mapping binary heap can be inserted, access and remove any element of complexity
hafumanbianma
- (1) 初始化。从终端读入字符集大小n，以及n个字符和n个权值，建立哈夫曼树，并将它存于文件hfmTree.txt中。 (2) 编码。利用已建好的哈夫曼树，对文件ToBeTra.txt中的正文进行编码，然后将结果存入文件CodeFil.txt中。 (3) 译码。利用已建好的哈夫曼树将文件CodeFile.txt中的代码进行译码，结果存入文件Textfile.txt中。 -Huffman encoder/decoder
shujvjiegoukejian
- 数据结构的上课课件，学习数据结构比不可少的课件-Data structure class courseware
shujvjiegoulianxijuan
- 数据结构的课后练习，全会做就能过这门课了-Data structure after-school practice
DateStructureCPP
- 数据结构与算法分析C++描述 期末评分的东东 自己写的，有用吧·-Analysis of data structures and algorithms described in C++ to write their own final score Dongdong, useful bar
joseph
- 严蔚敏版本数据结构题集约瑟夫环问题的源代码-Yan Wei-min version of the title sets the data structure the source code of the problem, Joseph Ring
small
- 计算PI的值有各种各样 ，看看这个算法是不是很简洁呢-Calculated PI values are varied, to see if this algorithm is not very simple and does