资源列表
A-novel-algorism-of-phase-unwrapping
- 本文基于二维快速傅里叶方法的基本原理提出了一种新的相位解包算法——菱形种子算法¬ 。该算法通过识别一个种子点，然后依次向相邻四点扩展，再把这四个点作为第二批种子点，依次向各自的四点邻域扩展，以菱形轨迹遍历所有的有效信息点，以到达整幅图像的相位解包。- A new algorism of phase unwrapping for measuring the material object is proposed based on the FFT method——algorism of diamon
qeqeqe
- matlab经典的三十个智能算法代码，你懂得，绝对经典-matlab classic thirty intelligent algorithm code, you know, an absolute classic. . .
sort
- 算法导论上十种算法的实现，桶排序，计数排序，堆排序，只要你能想到的都有-The ten kinds Sort algorithm
Socket
- Windows Socket五种I/O模型——代码全攻略-The Windows Socket five kinds of I/O model- code Raiders
data-struct
- 对于数据结构每一章节的相应的练习题，巩固好数据结构-To consolidate data structure corresponding practice questions for each chapter of the data structure
migong
- c++数据结构实习 求解迷宫问题 输入一个迷宫 起始位置和终点 输出所有可能的路线-the c++ practice data structure to solve the maze problem to enter a maze starting position and the end of the output of all possible routes
shuzhizhuanhuan
- c++数据结构实习 数制转换 输入一个十进制数和要转换成的进制数 计算出结果-c++ data structure internship number system conversion input a decimal and hexadecimal number to convert the calculated results
cycQueue
- 单循环链表，用C++实现 提供入队，出队，判断空等方法-Single cycle linked list, with C++ into the team, the team judge waited in vain for methods
Bloomfilter
- 一个基于APHash方法设计的Bloomfilter 构造需要提供参数：size（字符串总数）-The design based on APHash method Bloomfilter. Construct parameter: size (total number of strings)
PriorityQueue
- 泛型化的优先级队列（最小堆），用C++实现 使用前应重载小于号 -Generic priority queue(the minimum heap) with C++ achieve
layersequence
- layersequence,主要是数据结构算法中初级的一种，本程序时其一个简单的应用-layersequence is about alogrithom
Graph-structure
- 非线性结构图的两种建立和两种遍历，有助于学习者理解和分析-Two kinds of nonlinear structure to establish and two kinds of ergodic, help learners to understand and analysis