搜索资源列表
crawler2
- 利用广度优先遍历搜索一定范围内的所有网页,可用于建立搜索引擎和查找网络错误.-Our webcrawler will traversal a certain range of website from a given source URL by Breadth First Search
breadthfirsttraversal
- 数的广度优先遍历,数据结构中的试验,用C++实现了-The number of breadth-first traversal, data structure testing, using C++ implementation of the
eightnum
- 8数码的广度优先算法和A*算法。可以查找出最佳路径,并且自动演示-8 digital breadth-first algorithm and A* algorithm. Can search out the best path, and automatic presentation
searchengine
- 一个简单的网络搜索引擎的代码,有深度优先和广度优先两种搜索方式-A simple Web search engine code
DataStruct
- 此文件夹中共包括十二个小程序 AVL创建平衡二叉树,通过加入一个个的结点创建,并实现了平衡二叉树中的结点删除 Boyer_Moore算法的串模式匹配 Horspool算法的串模式匹配 Graph实现了有向图的非递归广度优先遍历及非递归深度优先遍历 HeapSort利用堆排序实现优先级队列 Merge实现二路归并排序算法 MFK动态规划解背包问题 nqueue求解n皇后问题 QuickSort快速排序算法的实现。 Shell排序算法的实现。 Tree程序
1
- 实验1 线性表(1) 输入若干正整数,建立一个顺序表,并在顺序表上实现如下操作:(1)在第3个元素位置插入666。(2)将第8个元素删除。(3)查找值为65的元素,若存在则输出,否则打印没有该元素。 实验2 线性表(2) 输入若干正整数,建立一个带头结点的单链表,并在单链表上实现如下操作:(1)在第3个元素位置插入666。(2)将第8个元素删除。(3)查找值为65的元素,若存在则输出,否则打印没有该元素。(4)查找第3个元素,若存在则输出,否则打印没有该元素。 实验6
3278
- poj 3278 Catch That Cow 采用广度优先搜索实现-poj 3278 Catch That Cow using breadth-first search to achieve
Broad-First-Search(AdjLGraph)
- 此代码为“图的广度优先遍历”的源代码,图的存储形式为邻接表,里面有图的邻接表存储的代码,还有广度优先遍历的算法,还有验证的主函数。-This code is " breadth-first traversal map" of the source code, Figure storage form of adjacency list, there are plans stored in the adjacent table code, as well as breadth-fi
WebSpider
- 可以对网络进行爬寻,具体爬寻方式可以设置为深度优先或者广度优先。-Climbing on the network can find the specific way of climbing can be set to look for depth-first or breadth-first.
shixiantudebianli
- MatToList(MGraph g,ALGraph *&G):将邻接矩阵g转换成邻接表G。 ListToMat(ALGraph *G,MGraph &g):将邻接表G转换成邻接矩阵g。 DispMat(MGraph g):输出邻接矩阵g。 DispAdj(ALGraph *G):输出邻接表G。 DFS(ALGraph *G,int v):以递归的方法从顶点v深度优先遍历图G。 =
123
- 图的遍历,广度优先与深度优先两种程序源代码-Graph traversal, breadth-first and depth-first source code in two
abc
- 图的广度优先遍历的程序设计,能实现其基本功能-Graph breadth-first traversal of the program design
gr
- 用DirectX 9.0C 实现广度优先-DirectX 9.0C 实现广度优先
chengshijiaotongbianlitu
- 城市交通遍历图,1、由数据文件生成邻接表,2、输出图邻接表,3、度优先遍历图,4广度优先遍历图-Urban traffic traverse map, 1, data files generated by the adjacent table, 2, the output graph adjacency list, 3, priority ergodic map, Figure 4, breadth-first traversal
Graph
- 图中查找元素,广度优先遍历,深度优先遍历-Find a map element, breadth-first traversal, depth-first traversal
tu
- 实现了图的创建,深度优先搜索和广度优先搜索-To create a graph, depth-first search and breadth-first search
Oil_distrb
- 广度优先解决小孩分油问题 在Ondraw里改变分油桶的容量及目标油量-Breadth-first solution to the issue of children at the oil change in the sub-Ondraw tank capacity and the target fuel
code
- 以邻接多重表为存储结构,实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点,分别输出每种遍历下的结点访问序列和相应生成树的边集。-To the adjacent multi-sheet for the storage structure, to achieve connected undirected graph depth-first and breadth-first traversal. To user-specified node as a starting point, r
wget-1.10.tar
- GNUWget 网页下载源码 设置网址 深度和广度优先-GNUWget downloaded source code to set the depth and breadth of the first web site
guangduyouxiansuosou
- 此算法是广度优先搜索的算法实现,已通过测验。-This algorithm is a breadth-first search algorithm, has passed the test.