资源列表
datastructure
- 学习数据结构时候自己写的相关练习代码和课程设计，包括队列 链表 队列等，课程设计包括源代码和文档-When studying the data structure related to practice writing their own code and curriculum design, including the queue, the queue list, etc. The curriculum includes the source code and documentation
Calculate-Pi
- 高效的数值算法，使用普通精度计算圆周率。不需要高精度的支持-Efficient numerical algorithm, calculation of pi using ordinary precision. Does not require the support of high-precision
DIJKSTRA
- Suppose you want to find the shortest path between two intersections on a map, a starting point and a destination. To accomplish this, you could highlight the streets (tracing the streets with a marker) in a certain order, until you have a route high
KRUSKAL
- * create a forest F (a set of trees), where each vertex in the graph is a separate tree * create a set S containing all the edges in the graph * while S is nonempty and F is not yet spanning o remove an edge with minimum weight from S o
my_BFS
- 1. Enqueue the root node. 2. Dequeue a node and examine it. * If the element sought is found in this node, quit the search and return a result. * Otherwise enqueue any successors (the direct child nodes) that have not yet been discovered.
MY_DFS
- DFS is an uninformed search that progresses by expanding the first child node of the search tree that appears and thus going deeper and deeper until a goal node is found, or until it hits a node that has no children. Then the search backtracks, retur
MY_QUICK
- 1. Pick an element, called a pivot, from the list. 2. Reorder the list so that all elements with values less than the pivot come before the pivot, while all elements with values greater than the pivot come after it (equal values can go either way
0-1hui
- 0-1背包问题 关于回溯法的背包问题 回溯法在求问题的所有解时, 要回溯到根结点, 且根结点的所有子树都已被搜索过才结束。-0-1 背包问题
AVL_BST
- 完整实现BST与AVLtree的功能 包括树的一节一节点的建立与一点一点的的删除-Binary search tree and AVL tree
FFT
- 数字信号中的傅里叶变换的基本算法的实现的程序-Digital signal in the Fourier transform procedures for the realization of the basic algorithm
ch1
- 严蔚敏《数据结构》第一章程序源码，用C实现。-Yan Wei-Min <data structure> the first chapter program source code, using C to achieve.
ch2
- 严蔚敏《数据结构》第二章程序源码，用C实现。-Yan Wei-Min <data structure> the sencond chapter program source code, using C to achieve.