搜索资源列表
-
0下载：
8数码问题（广度优先）
就是用广度搜索解决8数码问题-8 digital issues (breadth first) search solution is to use breadth 8 digital issues ... ...
-
-
0下载：
this an Artificial intelligence Breadth first search program made in c++ based on Breadth first search algorithm-this is an Artificial intelligence Breadth first search program made in c++ based on Breadth first search algorithm
-
-
1下载：
图的创建，深度优先和广度优先搜索，有实验报告-Map creation, depth-first and breadth-first search, there are experimental reports
-
-
0下载：
实例12
简单的计算器
实例13
时钟程序
实例14
华氏温度和摄氏温度的相互转换
实例15
SimpleDebug函数应用
第2部分
数值计算与数据结构篇
实例16
常用的几种排序方法
实例17
广度优先搜索及深度优先搜索-Instance 12
Simple calculator
Instance 13
Clock program
Instance 14
Fahrenhe
-
-
0下载：
这是通过图的遍历操作实现图的广度优先搜索，是通过邻接矩阵实现的-This is achieved through the operation of graph traversal graph breadth-first search is implemented through the adjacency matrix
-
-
0下载：
人工智能中的宽度优先搜索算法，保证原创，开源共享-Artificial Intelligence in the breadth-first search algorithm to ensure the original, open-source sharing
-
-
0下载：
对任意给定的图（顶点数和边数自定），建立它的邻接矩阵并输出，然后利用队列的五种基本运算（置空队列、进队、出队、取队头元素、判队空）实现图的广度优先搜索算法-For any given graph (vertices and the number of edges from the set), to establish its adjacency matrix and the output, then use the queue of five basic operations (blank qu
-
-
0下载：
用图的广度优先搜索算法实现农夫过河问题求解-Breadth-first search with a map to achieve problem solving across the river
-
-
0下载：
数据结构中的图的遍历问题。
设计一个网络蜘蛛系统，用有向网表示网页的链接网络，其中，顶点表示某个网页，有向弧表示网络之间的链接关系。并且分别以a. 深度优先搜索，b. 广度优先搜索的策略抓取网页。-The graph data structure traversal problem. Design a web spider system, with a link to the web page that network, where vertices a page, there is the
-
-
0下载：
Its a source code to find the breadth first search of a tree.It works both for tree as well as for forest.It has 3 files the source code bfs_forest.c
, the input file bfsinput1.txt and output file.
-
-
0下载：
C++语言下的有向图深度优先搜寻和广度优先搜索-C++ language under the directed graph depth-first search and breadth-first search
-
-
0下载：
breadth first search
-
-
1下载：
根据从键盘输入的数据创建图（图的存储结构可采用邻接矩阵或邻接表），并对图进行深度优先搜索和广度优先搜索（实验类型：验证型）
1）问题描述：在主程序中提供下列菜单：
1…图的建立
2…深度优先遍历图
3…广度优先遍历图
0…结束
2）实验要求：图的存储可采用邻接表或邻接矩阵；定义下列过程：
CreateGraph(): 按从键盘的数据建立图
DFSGrahp()：深度优先遍历图
BFSGrahp()：广度优先遍历图-According to dat
-
-
0下载：
breadth-first search
-
-
1下载：
八数码拼图游戏的求解程序,通过双向广度优先搜索算法,输出最优解的路径.-Eight digital jigsaw puzzle solving process, through bi-directional breadth-first search algorithm, the optimal solution output path.
-
-
0下载：
8数码问题的解决方案，宽度优先搜索，和广度优先搜索，可以通过修改期中的全局值，可以适应任何维度的搜索-8 digital solution to the problem, breadth-first search, and breadth-first search, you can modify the period of global value, can adapt to any dimension of the search
-
-
2下载：
能够建立有向图无向图的邻接矩阵和邻接表表示法，深度优先和广度优先搜索，能够存储和显示相应的搜索结果（深度优先或广度优先生成森林（或生成树）、深度优先或广度优先序列和编号）。以文件形式输入图的顶点和边，并显示相应的结果。-To build a directed graph undirected adjacency matrix and adjacency list representation, depth-first and breadth-first search, to store and
-
-
0下载：
对任意给定的图（顶点数和边数自定），建立它的邻接表并输出，然后利用堆栈的五种基本运算（清空堆栈、压栈、弹出、取栈顶元素、判栈空）实现图的深度优先搜索遍历和广度优先搜索遍历算法。
-For any given graph (vertices and edges from the set), to establish its adjacency list and output, and then use the stack of five basic operations (empty stac
-
-
0下载：
人工智能课程设计，关于广度优先搜索的一个实例-Artificial intelligence curriculum design, breadth-first search on an instance of
-
-
0下载：
搜索算法的示例 采用广度优先搜索算法 代码示例 八皇后问题-Examples of search algorithm using breadth-first search algorithm code sample eight queens problem
-
«
1
2
3
4
56
7
8
9
10
...
13
»
