资源列表
time
- class date的函数体及其他时间类的函数体-class date of the function body and the body of the function class, other times
Arithmetic-Dijkstra
- Dijkstra算法是典型最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解-Dijkstra algorithm is a typical shortest path algorithm, to calculate a node to all other nodes of the shortest path. Main features is the starting point for t
migong
- 简单的c++小程序，实现迷宫路线输出。可以自定义迷宫，用1代表不可走，0代表可走，进行输入。然后自定义起始点，输出一条可行路线。-Simple c++ applet to achieve the maze route output. You can customize the maze, can not go with 1 for, 0 to go, for input. Starting point and then customize the output a feasible route.
2
- 计算二叉树的叶子结点树，实现代码的编译和运行-Calculated binary tree leaf node, the code compiles and runs to achieve
JiFen
- 用梯形公式和simpson公式求积分-with trapezoidal formula and simpson formula quadratures
akm
- 阿克曼函数，一种十分有效的函数，在数据结构中使用得多。
zz
- 这一算法实现了堆存存储结构的串的置换操作REPLACE(&S,T,V)-This algorithm achieved a stockpiling storage structure of the string replacement operation REPLACE (& S, T, V)
Circular_Queue_Implementation_using_Arrays
- Circular Queue Implementation using Arrays
cunchujiegou
- 采用邻接矩阵实现有向网的存储，建立有向网，并实现单源最短路径算法。 -Adjacency matrix storage to the network, to establish a network and single-source shortest path algorithm.
bellFord-(2)
- BellFord 算法，查找图的最短路径，C++代码实现-BellFord algorithm, find out the shortest path of figure and c++ code implementation
BiTree
- 二叉排序树的建立、插入与删除。按递增顺序插入N个整数，并按同样顺序删除；-Binary sort tree establishment, insertions and deletions. Insert N integers in ascending order, press the same sequence deleted
huffman
- c 语言实现的哈弗曼算法 用到二叉树的遍历-the c language Hafuman algorithm Use binary tree traversal