资源列表
DELAUNAY.algorithm
- DELAUNAY三角剖分算法源程序c++实现。非常详细的源代码。-DELAUNAY triangulation algorithm source code c++ implementation. Very detailed source code.
IndexDemo
- 一个学习数据结构的好例子，通过此代码能够学习倒排索引时如何创建的，本代码在vc6.0下运行通过-A good example of learning data structure, through this code to learn how to create the inverted index, and the code vc6.0 run through! ! !
word_filter
- 高效的脏词过滤功能，使用trietree算法实现的-Efficient dirty word filtering, the algorithm used trietree
BinaryTree
- 用MFC实现的二叉树的建立、查找、删除、插入-MFC achieved with the establishment of a binary tree, find, delete, insert
migong
- MFC 的迷宫小游戏数据结构课程设计：迷宫，采用Visual C++ 6.0开发，适合初学者学习使用-MFC maze game data structures curriculum design: a maze, using Visual C++ 6.0 development, suitable for beginners learning to use
grapher
- 深度优先，广度优先，最短路径，最小生成树的图形演示以及源代码-Depth-first, breadth-first, shortest path, minimum spanning tree, as well as graphical presentation source
SQP
- 这是基本的二次规划算法，能够帮助初学者很好的掌握二次规划的基本概念，深入理解优化设计的程序。-This is the basic quadratic programming algorithm that can help beginners a good grasp of the basic concepts of quadratic programming, in-depth understanding of optimal design of the program.
a
- 禁忌搜索算法，解决三十个城市间的旅行商问题，求出最短距离-Tabu search algorithm to solve thirty cities between the traveling salesman problem, find the shortest distance
DSDVAlgorithm
- 采用及其简单的方法实现dsdv选路算法，多线程，udp协议，读取初始距离信息，计算最短路径-dsdv algorithm
minimum-spanning-tree
- 使用C#图形界面生成最小生成树，核心算法使用Prim算法。图的形状可以在源文件中的图定义处修改。-C# graphical interface to generate a minimum spanning tree, the core algorithm using Prim algorithm. The graph shape defined in the source file in Figure modify.
RANSAC
- RANSAC算法，可以用来剔除无匹配点。-RANSAC algorithm can be used to eliminate non-matching points.
software_fifo
- 一种软件FIFO的实现源代码，供学习参考-FIFO implementation of a software source code reference for the study