搜索资源列表
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
bmsearch_src.zip
- BM关键字查找算法，在用于查找子字符串的算法当中，BM（Boyer-Moore）算法是目前相当有效又容易理解的一种，一般情况下，比KMP算法快3-5倍。,BM keyword search algorithm used in the sub-string search algorithm which, BM (Boyer-Moore) algorithm is quite effective and easy to understand A, under normal circumstances
set
- 详细介绍并查集的定义，算法实现，和应用，便于学习并查集的好资料-Set details and check the definition of algorithm, and applications, easy to learn and a good set of information search
DFSBFS
- 关于数据结构搜索方法中的深度优先搜索及广度优先搜索的算法及比较,c语言描述,简单易懂.-Search method on the data structure in the depth-first search and breadth-first search algorithm and comparison, c language to describe, easy to understand.
Binary-tree-search
- 这是一个有关二叉树查找类，总的来说比较好用-This is a binary tree to find the class, are generally more easy to use
binary_search
- 二分查找算法：算然很简单但是要写好不容易，请指正-Binary search algorithm: operator ran a very simple but not easy to write, please correct me
wenxueyanijiuzhushou
- 这是一个使用与初学C++的同学使用的成学，是一个简单的文学检索的程序，简单易懂，希望对大家有帮助-This is a beginner C++ using the students into the use of science, literature search is a simple procedure, easy to understand, we want to help
DFS
- 深度优先搜索算法，代码简单易懂，对于初学者很容易理解-Depth-first search algorithm, the code easy to understand, easy to understand for beginners
EightNumber
- 采用有界深度优先搜索算法求解八数码难题，代码简单易懂-Using bounded depth-first search algorithm for Eight puzzle, the code easy to understand
search
- 数据结构：利用C++实现顺序表查找，代码简单易懂。-Data Structures: Using C++, the order table to find the code easy to understand.
notebook
- 实现对原始数据的保存、读取，按姓名查找，记录的插入、删除，程序有美观的界面并且程序建立在windows窗口下，所有的操作均可以通过鼠标完成，而且界面友好，易于操作。 -To achieve the preservation of the original data, read, search by name, record insert, delete, the program has beautiful interface and the program established under
graph(linjiejuzhen)
- 基于C++模板，用邻接矩阵的方式，实现了基本的Graph(map)的构建，并实现了深度优先搜索和广度优先搜索，同时加入了测试用的数据读入和写入函数，便于调试和在本代码基础上进行进一步扩充。-Based on C++ templates, adjacency matrix, enabling a basic Graph (map) to build and achieve a depth-first search and breadth-first search, also joined the
search
- 数据结构上机实验——文学助手。可实现读取txt文件或其它文件，扫描其中某个英文字幕或单词并输出搜索词出现的位置。简明、易懂、C++自编版。-Data structure on experiments- literary assistant. Txt file to read can be achieved or other documents, or scan one of the words in the English subtitles and output of the search w
ciyoushu
- 数据结构中次优查找树程序，用于查找数据非常方便-Data structure in sub-optimal search tree program, very easy to use to find data
zhebanchazhao
- 这半查找法 是一种快速查找算法 查找效率比较高 容易实现 理想的查找算法-This search method is a fast and find more efficient algorithms to find easy to implement the ideal search algorithm
BinarySearch
- 有序表的折半查找（变得很简单），在VC下做的，但是是用c写的。-Binary search order table (made easy), under the VC to do, but it is written with c.
Selection-Sort
- 选择排序也是一种简单直观的排序算法。它的工作原理很容易理解：首先在未排序序列中找到最小（大）元素，存放到排序序列的起始位置；然后，再从剩余未排序元素中继续寻找最小（大）元素，放到已排序序列的末尾。以此类推，直到所有元素均排序完毕。-Selection sort is a simple and intuitive sort algorithm. Its working principle is easy to understand: first in the unsorted sequence t
AVL树
- 二叉树的ADT、搜索树的ADT、平衡二叉树的ADT。AVL树包含了AVL的建立、查找、删除操作。全部使用类模板，方便调用(ADT for binary tree, ADT for search tree, ADT for balanced binary tree. AVL tree contains the establishment of AVL, find, delete operation. All use of class templates, easy to call)