资源列表
graph
- 用邻接表的方式建立一个图，可以对这个图进行删除边，增加边，删除增加节点，和深度广度优先搜索-With the adjacency list of ways to build a map, you can delete the edges of this graph, increasing side, remove the added nodes, and depth of breadth-first search
nipolan
- 一个用栈实现的逆波兰算法，输入表达式，可以算出值-Stack implementation using the inverse of a Polish algorithm, the input expression, the value can be calculated
fei-digui-tree
- 利用非递归的方式对一个二叉树进行操作 比如先序中序后序遍历-Use of non-recursive way to operate on a binary tree such as the first post-order traversal sequence in order
digui-binary-tree
- 利用递归的方式对一个二叉树进行操作 比如先序中序后序遍历-Recursive way to operate on a binary tree such as the first post-order traversal sequence in order
c
- c语言链表程序，可用且实用，适合c语言初学者实用-c language program list, available and practical, suitable for beginners
1
- 最小树形图，一个有向图的最小生成树，直接模板套用-The smallest tree, a directed graph of the minimum spanning tree, apply directly to the template
rtree
- 空间索引树R-tree使用C语言实现，希望对大家有用-R-tree spatial index tree using the C language, we hope to be useful
pku-1376
- pku1376 机器人，数据结构 深度或广度-pku1376 robot, the depth or breadth of the data structure
min_distance
- 本算法用于求一系列点集中距离最小的点对,利用分治，递归，大大减少计算量-This algorithm is used to find a point of focus from the minimum point, the use of divide and conquer, recursion, greatly reducing the computational
btree
- 先序递归创建二叉树，计算二叉树中叶子节点的个数-Create a binary tree recursive first order to calculate the number of leaf nodes in binary tree
px
- 快排的非递归算法,待排记录数小于3时不再进行分割，而是直接进行比较排序-Non-recursive algorithm for fast row, row the number of records to be no longer than 3 to segment, but a direct comparison sort
tu
- 采用邻接表存储结构，编写一个判别无向图中任意给定的两个顶点之间是否存在一条长度为k的简单路径的算法。-Using the neighbor table to store the structure, the preparation of a judge not to any given graph between two vertices if there exists a simple path of length k of the algorithm.