资源列表
数据结构常用算法(CPP)
- 数据结构常用算法C++，快快下载，望 能给大家帮助-data structure used algorithm C, quickly download, we can look to help
数据结构常用算法(C)
- 数据结构常用算法C实现，一定不要错过，对编程有很大帮助-data structure used to achieve C algorithms, we should not miss the programming is very helpful
04418300
- 该程序能够实现傅立叶的快速转换和放转换用vb语言来实现，整体效果不错！-the procedures to achieve fast Fourier transformation and the conversion put vb language used to achieve the overall effect was excellent!
ADS_DFS_Maze
- 采用stack算法的DFS搜索，有java做的界面，还有适当的注释-using stack DFS search algorithm, so java interface, the appropriate Notes
算法与数据结构技术!
- 算法与数据结构技术!想学C语言数据结构的看看有一定的帮助-algorithm and data structure technology! Like the C language data structures to see if there is some help
索引技术
- 是当初的数据结构的做业,用的是b+树这一块,非常值得初学者的参考-is the original data structure for doing business, it was a b tree this very worthwhile reference beginners
哈希表二次探测再散列法
- vc开发的二次探测在散列算法,学习数据结构的学习者看看吧!! -vc developed to detect the secondary hash algorithm, the data structure learners see! !
用线性表实现的Btree
- 实现m阶B_树 （2）将线性表中的键值插入到B_树中（即建立索引）； （3）当删除和插入数据到线性表时，同时维护其索引B_树。 （4）可根据所给键值范围，输出该范围的所有键值-achieve m bands Containing tree (2) linear scale for the keys inserted into Containing tree (index); (3) When the deletion and insertion of data to the linear sca
KruskalAlgorithm
- 本文件主要完成Kruskal算法。本文件包括三个类，分别是顶点类、边类和Kruskal类。-The document completed Kruskal algorithm. This document consists of three categories, namely category vertex, edge type and Kruskal category.
ClosestPairPoint
- 实现查找一组给定点中的最近点对，通过分治方法将问题求解，简化问题的复杂性。-Lookup a group to the latest sentinel points right, adoption of the partition method of problem solving, simplifying the complexity of the problem.
Matrix_Chain
- 求解矩阵链相乘的问题，通过动态规划的方法，来求解该问题，使得矩阵链的相乘的运算最少。-chain matrix multiplication to solve the problem through dynamic programming methods to solve the problem, making the chain matrix multiplication operator at least.
HeapSort
- 实现heap排序的算法，首先把Heap建立起来，然后通过对Heap的根节点来找出当前最小的节点，依次就可以实现排序了。-achieve heap sorting algorithm to first establish Run, then Run right through the current nodes to identify the smallest nodes can be followed to achieve the ranking.