资源列表
dijkstra
- It is a c++ code for the dejkstra algorithm with aim to find the shorest path between two points , the nodes with the distance between them store in a txt file and the program read it from this txt file
dui
- 堆排序：用堆排序的方法对记录排序，初始化堆 ，整理堆 ，输出堆顶元素，并将最后一个元素放到堆顶位置，重新建堆。-Heap sort: The sort of method heap sort records, initialize heap, Heap, the top element of the output heap and stack the last element into the top position, re-built reactor.
suanfa
- 请选择操作: 1. 最近点对 2. 假币问题 3. 堆排序 4. 全源最短路径-Please choose: 1. Nearest points on 2. Counterfeiting problem 3. Heap sort 4. All source shortest path
4
- 串的操作： 包括串的赋值，清空，串之间的比较，获取字串等等。-Series of operations: including string assignment, empty, string comparison between, for strings and so on.
5
- 矩阵的相关操作： 矩阵赋值，输出，矩阵的相加，得到矩阵中的某行某列等等。-Correlation matrix operations: matrix assignment, output, matrix add, get in a matrix of a column in a row and so on.
zhan
- 栈的相关操作： 栈初始化，栈满栈空的判断，元素的增加，元素的删除和栈的清空等等。-Stack-related operations: stack initialization, stack full stack empty judgments, the elements increase, the element to delete and empty the stack and so on.
UseList
- 基本的链表操作，节点加入，删除，遍历等。对理解使用链表有用-The list of basic operations, the node add, delete, traverse, etc.. Useful in understanding the use of linked list
jisuanqi
- 一个一元稀疏多项式简单计算器: 1 输入并建立多项式； 2 输出多项式，输出形式为整数序列n,c1,e1, c2,e2,,,,,,, cn,en,其中n是多项式的项数，ci,ei,分别是第i项的系数和指数，序列按指数降序排序； 3 多项式a和b相加，建立多项式a+b；如果用单链表存储多项式，则用a存储多项式（a+b）。如果用队列存储多项式，则需为多项式（a+b）另外创建一个队列。 4 多项式a和b相减，建立多项式a-b；如果用单链表存储多项式，则用a存储多项式（a+b）。如果用队
polynomial
- 基于快速傅里叶变换，实现的多项式相乘算法。同时与普通多项式相乘对比。-Polynomial Multiplication based on FFT
Splay
- Splay Tree，伸展树，一种实现简单的平衡二叉树，增删改查的时间复杂度均为O(logN）-Splay Tree
Inorder_BiTree
- 二叉树的构造及遍历 Construction and traverse binary tree先序遍历输入再中序遍历输出-Binary tree structure and traversing Construction and traverse binary tree in preorder traversal sequence and then traverse the input output
hashtable
- 哈希表c代码 学习c 有帮助，对于有一定c基础的可以看下-hashtable