当前位置:
首页
资源下载
![](/images/right.gif)
搜索资源 - Breadth First Search
搜索资源列表
-
1下载:
基于java语言实现的树的深度优先搜索和广度优先搜索-Based on java language tree depth-first search and breadth-first search
-
-
0下载:
广度优先搜索实现8数码问题,C语言实现,代码不长,不到三百行,仅供参考。-implemention of 8 digital problem by Breadth first search
-
-
0下载:
深度优先和广度优先搜索序列,并画出所得到的深度优先生成树以及广度优先生成树。假设选择原则是按字母从小到大排列-Depth first and breadth first search sequence, and draw the depth of the get priority spanning tree and breadth first spanning tree. According to the principle of choice is that since the arrange
-
-
0下载:
In computer science and data mining, Apriori is a classic algorithm for learning association rules. Apriori is designed to operate on databases containing transactions. The algorithm attempts to find subsets which are common to at least a minimum num
-
-
0下载:
In computer science and data mining, Apriori is a classic algorithm for learning association rules. Apriori is designed to operate on databases containing transactions. The algorithm attempts to find subsets which are common to at least a minimum num
-
-
0下载:
图的深度优先搜索和广度优先搜索以及一个无向图的拓扑排序-Graph depth-first search and breadth-first search and topological sorting of a directed graph
-
-
0下载:
本程序采用广度优先搜索算法求解农夫过河问题-This program uses a breadth-first search algorithm for the farmer across the river
-
-
0下载:
根据图的广度优先搜索算法,用数组模拟队列处理的迷宫问题。-According to the graph breadth-first search algorithm queue processing using an array of simulated maze.
-
-
0下载:
This the source-code for the algorithm breadth-first search.-This is the source-code for the algorithm breadth-first search.
-
-
0下载:
本程序上层算法采用深度搜索和广度搜索相结合的折中方法,能适合大部分迷宫的最优路径搜索。-This program algorithm using the upper search and breadth first search depth of the combination of this way, for most of the maze can the optimal path search.
-
-
0下载:
本程序上层算法采用深度搜索和广度搜索相结合的方法,能在大部分迷宫中快速搜索到最优路径。-This program algorithm using the upper search and breadth first search depth of the method of combining the most rapid in the maze in search to the optimal path.
-
-
0下载:
迷宫问题广度优先搜索,本程序针对迷宫问题,采用广度优先策略惊醒搜索,如能到达,输出路径长度,否则输出-1表示不可到达-Breadth-first search of the maze problem
-
-
0下载:
分别用邻接矩阵和邻接表实现图的深度优先搜索和广度优先搜索-Adjacency matrix and adjacency were used to map the table to achieve the depth-first search and breadth-first search
-
-
0下载:
图的遍历及实验报告。输入构建一个无向图,将其用深度优先搜索的递归和非递归遍历以及广度优先搜索遍历,并输出。-Graph traversal and experimental reports. Input to build a non-directed graph, its recursive and non-recursive traversal depth-first search, and breadth-first search traversal, and output.
-
-
0下载:
解决八数码问题的广度优先搜索的源代码,编程语言为C-Solve the problem of eight digital breadth first search source code.For c++ programming language
-
-
0下载:
八数码问题也称为九宫问题。在3×3的棋盘,摆有八个棋子,每个棋子上标有1至8的某一数字,不同棋子上标的数字不相同。棋盘上还有一个空格,与空格相邻的棋子可以移到空格中。要求解决的问题是:给出一个初始状态和一个目标状态,找出一种从初始转变成目标状态的移动棋子步数最少的移动步骤。所谓问题的一个状态就是棋子在棋盘上的一种摆法。棋子移动后,状态就会发生改变。解八数码问题实际上就是找出从初始状态到达目标状态所经过的一系列中间过渡状态。
八数码问题一般使用搜索法来解。搜索法有广度优先搜索法、深度优先搜索法
-
-
0下载:
能够输入输出一个图的邻接矩阵,能够对相应的边和顶点进行插入删除操作,能够进行深度和广度优先搜索遍历-The adjacency matrix of a graph can be input and output, insertion and deletion operations to the corresponding edges and vertices, depth and breadth-first search traversal
-
-
0下载:
C语言程序 算法设计 人肉搜索之宽度优先搜索算法-C language programming algorithm design of the human flesh search breadth-first search algorithm
-
-
0下载:
爬虫软件,截取页面上的链接。采用广度优先搜索-Crawlers software the interception page on the link. Breadth-first search
-
-
0下载:
NwebCrawler是用C#写的一款多线程网络爬虫程序,它的实现原理是先输入一个或多个种子URL到队列中,然后从队列中提取URL(先进先出原则),分析此网页寻找相应标签并获得其href属性值,爬取有用的链接网页并存入网页库中,其中用爬取历史来记录爬过的网页,这样避免了重复爬取。提取URL存入队列中,进行下一轮爬取。所以NwebCrawler的搜索策略为广度优先搜索。采用广度优先策略有利于多个线程并行爬取而且抓取的封闭性很强。-NwebCrawler is a multi-threaded w
-