资源列表
傅里叶级数逼近源码
- 傅立叶级数在数字信号处理中有非常重要的应用，这里提供了傅立叶级数在C环境下的源码及其应用，对于数据处理的工程人员大有裨益。-Fourier series in the digital signal processing is a very important application, it provides Fourier Series C environment in the source and application of data processing for the engineeri
fina_ver
- 用迷宫算法实现聚点的统计，这里只是简单扫描每个像素的四个方向，当然，可以很容易修改源码，实现八个方向的扫描，至于聚点嘛，就是被数码0包围的数码1组成的块，这种算法在元件识别方面可以应用。-maze algorithm used accumulation of statistics, here simply scanning each pixel of the four directions, of course, you can easily modify the source codes to
C Algorithm_配套源码Robert Sedgewick
- 这是Donald Kunth（计算机科学学术界最最有名的大师级人物，曾获图灵奖及其他无数科技奖项）的弟子Robert Sedgewick的名著C算法一书的配套源码-Kunth (computer science academic gurus of the most famous figures, won the Turing Award and countless other technology awards) Robert Sedgewick the disciples of the fam
Data Structures And Problem Solving Java Source Co
- 这是数据结构与问题求解的Java版的源码-This is the data structure and problem solving version of the Java source code
unix suanfa
- 主要是一些算法问题 unix/C 开发，矩阵，网路等问题-algorithm is the main problem unix / C development, matrix, the Internet and other issues
libgist-2.0.1
- Libgist is an implementation of the Generalized Search Tree, a template index structure that makes it easy to implement any type of hierarchical access method (AM). -Libgist is an implementation of the Generalized Search Tree, a template index stru
HnSRTree-2.0beta5a
- SR-tree is an index structure for high-dimensional nearest neighbor queries，C++ sourcecode. SR-tree outperforms the R*-tree and the SS-tree especially for high-dimensional and non-uniform data which are likely to appear in the actual image / video a
minheap vs minleftisttree
- 这是一个用C++编写的代码,实现了最小堆和最小左偏树在插入删除元素性能方面进行比较. -This is a preparation of the C code, the smallest and youngest sculpture tree in the left side inserted delete elements performance comparisons.
quick_sort
- 快速排序，实现排序的时间再一般情况下的时间复杂性为nlogn算法实现-Quick Sort and achieve ranking period of time under normal circumstances the complexity of finite algorithm
kruskal最小生成树实现
- 在boost基础上实现 对图的最小生成树实现，通过此算法可以找到此图中连接所有点的最小生成树。-the boost on the basis of the plan to achieve the minimum spanning tree, the algorithm can find this map connect all the points the minimum spanning tree.
EulerXXX
- 关于欧拉算法的表示,一个简单的演示,用c做的,希望对大家有帮助-on Euler algorithm, a simple demonstration of using c doing, we hope to help
(最大和问题)
- 求一个矩阵的最大和，并判断两个矩阵的最大和-seek a matrix of the largest and, to judge two of the largest and Matrix