资源列表
Fibonacci
- 如何解决Fibonacci数列问题的源代码-How to solve the problem of Fibonacci series of source code
mtc
- 一共用9个压缩包,每个都包含一些经典的算法,其中用图形函数的使用,对学习数据结构很有帮助.-9 a share package, each contains a number of classical algorithms, which function with the use of graphics, very useful data structure for learning.
7
- 二叉树排序代码，动态生成二叉树，进行动态查找-Binary tree sort code, dynamically generated binary tree, dynamic search
Subset
- 这是一个关于用递推法解决求某一个集合的所有的子集。非常适合初学数据结构的同胞阅读。-It is a recursive method used to solve a set for a subset of all. Data structure is very suitable for beginners to read compatriots.
tin
- 一种更简单，效率更高的最小生成树的基于VC的环境的算法！-A more simple, more efficient VC-based minimum spanning tree algorithm for the environment!
1
- 在知道点的坐标或者数量和权重值时，选择最优的路径，这种有的是基于时间有的是基于运费等等，自动找两点路径最短距离！-Know the coordinates of points in the volume and weight or value, the choice of the optimal path, this time based on some because of some freight, etc., automatically find the shortest distance
11
- 在地理信息系统概率中，知道一个数据表，用编程的方法求它们的MORDAN码值-Geographic Information System in the probability of that a data table, using the method of programming for the value of their code MORDAN
KMP
- 实现KMP算法。 经典的模式搜索算法。-KMP algorithm realization. Classical algorithms.
kaikuohaohebikuohaodepipei
- 开括号和比括号的匹配，数据结构内容，很不错-More than brackets and brackets to open the match, the contents of data structure
Primalgorithm
- 普里姆算法求最小生成树(邻接表存储)，用c++描写的，数据结构中的-Prim algorithm for minimum spanning tree (adjacent table storage), with c++ descr iption, data structure
tt
- 用KRUSKAL算法求最短路径,可以运行C++源程序-KRUSKAL algorithm used for the shortest path, you can run C++ source code
stackqueue
- 数据结构栈和队列基本源代码，并包括银行模拟、中缀表达式计算、列车调度、农夫过河问题等经典数据结构算法。-Stack and queue data structure of the basic source code, and includes Bank of simulation, in the calculation is made up of expressions, the train scheduling, the farmer across the river, such as the