资源列表
vacabulary
- 分词程序，运行ss.sln，即可实现将所给txt文件中的文章按规定进行分词。将分词后的结果生成新的txt文件，result。-Segmentation procedure run ss.sln, you can achieve the article to txt file according to the provisions of sub-word. Generate new word txt file, result.
sort_methods
- 插入、选择、冒泡、快速排序。很多学校数据结构的实验都是这几个排序。已编译通过，可供参考。-Insert, select, bubbling, quick sort. Many experimental school data structures are a few sort. Compiled by, for reference.
huffman_coder
- 课程设计，哈夫曼编码器的c语言实现，已验收通过，附带设计论文。-Curriculum design, Huffman encoder c language, the acceptance by fringe design thesis.
floyd_method
- 弗洛伊德算法求两点间最短距离。也是数据结构实验要用的算法，小做修改，改成自己需要的就能验收-Freud algorithm for getting between two points is the shortest distance.
two_bauchs_tree_method
- 二叉树算法，应用很广泛的经典的数据结构，也是高校数据结构实验的必修。-Binary tree algorithm, application of a wide range of classic data structure, the university data structure experiments compulsory.
worker_manager
- 简易职工管理系统，没有做界面，只是控制台，但性能比较稳定，读写文件而不是数据库，读写速度快。-Easy staff management system, there is no interface to do just the console, but the performance is relatively stable, read and write files rather than a database, read and write speed.
FOJ_1683
- FOJ的1683题，采用二分矩阵乘法的实现，源代码已在OJ上测试通过-FOJ' s 1683 title, with the realization of the binary matrix multiplication, the source code has been tested in the OJ by
CPP
- C++相关程序很好用的请大家赶快下载浏览，一定对你会有帮助的。-very good for C++
test
- 初始化Opengvs，包括系统自身的调用和回调用户的函数。-Initialization Opengvs, including call and callback function of the user of the system itself.
hanoi
- C++语言递归算法求解原始汉诺塔问题,邻近移动汉诺塔问题,循环移动汉诺塔问题,奇偶汉诺塔问题-Recursive algorithm for the original Tower of Hanoi problem, neighboring mobile HANOR, the loop mobile HANOR issue, parity Tower of Hanoi problem
maze
- C++迷宫问题求解,随机生成迷宫存放于二维数组,为保证至少有一条通路,再生成一条路径置入迷宫中,然后回溯法求解-C++ maze problem solving randomly generated maze stored in a two-dimensional array, in order to ensure at least one path, and then generate a path into your maze, then backtracking to solve
dft_img
- dft加速算法，可以对图像进行fft变换，代替fft-dft accelerated algorithm fft transform image, instead of fft