搜索资源列表
chenbo广度
- 人工智能运用广度优先算法来解决八数码问题,由初始状态到目标状态按层搜索-breadth priority use of artificial intelligence algorithms to solve eight digital issue, the initial state to the target state by layer Search
图的广度搜索
- 图形的广度优先搜寻法-graphics breadth priority search method
guangdu
- 人工智能中的广度优先搜索算法,以八数码管为例进行编程实现-Artificial Intelligence in the breadth-first search algorithm, for example eight programmable digital control to achieve
tu
- 以邻接表为存储结构,实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点,分别输出每种遍历下的结点访问序列。 -To the adjacent table for the storage structures, to achieve connectivity of undirected graph depth-first and breadth-first traversal. To user-specified node as a starting point, respective
6.7.1
- 图的深度和广度优先搜索 1.图采用邻接表的存储结构 2.深度优先搜索图 3.广度优先搜索图-1. Graph using adjacency list of the storage structure 2. Depth-first search Figure 3. Breadth-first search graph
C
- 图的深度优先遍历,图的广度优先遍历,及图的存储-Map depth-first traversal, breadth-first traversal of the graph, and map storage
erchashu
- 本文利用C语言实现了简单的二叉树,每个结点只保存一个整数,并且,由于非常简单,树的根结点是确定的,而不是输入的。确定根结点以后,用户输入的每一个数都被insert到树中(-999表示停止),利用深度优先的方法。建立好二 叉 树以后,分别利用深度优先(DFS)和广度优先(BFS)进行了遍历,输出结果。-In this paper, the use of C language realization of a simple binary tree, each node only maintains
Savage_with_plans_to_cross_the_river_breadth_first
- 关于野人过河问题中的程序设计,包括用图的广度优先搜索算法-Across the river on the Savage program design issues, including breadth-first graph search algorithm
BFS
- 广度优先搜索算法分析;供程序设计人员使用-Breadth-first search algorithm analysis for programmers to use
8digital_issues_breadth-first_search_code
- 八数码问题的广度优先算法,输入初始状态和目标状态,若有解则输出解空间-8 digital issues breadth-first algorithm, enter the initial state and target state, if it has solution, then the output is the solution space
main
- 采用邻接矩阵表示无向图,完成图的创建、图的深度优先遍历、图的广度优先遍历操作。其中图的顶点信息是字符型,图中顶点序号按字符顺序排列。本输入样例中所用的图如下所示: Input Format: 第一行输入两个值,第一个是图中顶点的个数,第二个是图中边的条数 第二行输入各顶点的信息,即输入每个顶点字符 第三行开始输入每条边,每条边的形式为两个顶点的序号,中间以空格隔开,输入完一条边换行 Output format: 首先输出图的顶点信息,输出完毕换行 接着输出图的邻
Traversing_Graph
- 树的邻接表表示和邻接矩阵表示,以及图的广度优先和深度优先遍历。-Tree adjacency list representation and adjacency matrix representation, and the graph breadth-first and depth-first traversal.
bashuma
- 八数码问题的求解系统 利用广度优先搜索方法-8 Puzzle Problem Solving System using breadth-first search method
language12-17casesofactual
- 实例12 简单的计算器 实例13 时钟程序 实例14 华氏温度和摄氏温度的相互转换 实例15 SimpleDebug函数应用 第2部分 数值计算与数据结构篇 实例16 常用的几种排序方法 实例17 广度优先搜索及深度优先搜索-Instance 12 Simple calculator Instance 13 Clock program Instance 14 Fahrenhe
graph_C(1)
- 建立无向图的邻接矩阵存储;对已经建立的无向图进行深度优先和广度优先遍历操作。建立有向图的邻接表存储;对已经建立的有向图进行深度优先和广度优先遍历操作。 -Establishment of the adjacency matrix storage on the already established undirected graph depth first and breadth-first traversal operation. Establish a table to store th
WFS
- 广度(宽度)优先搜索,将八数码问题简化成三数码问题求解(Breadth (range) first search simplifies the eight digital problem into three digital problem solving)
ConsoleApplication1
- 实现图的广度优先遍历,利用结构体指针,非常适合数据结构初学者。(Breadth first traversal of Graphs)
dp
- 深度优先搜索和广度优先搜索的代码....(Depth search breadth first search)
广搜
- 这是一份广度优先搜索的代码,代码很简单,很容易就能理解广搜的核心。(This is a breadth first search algorithm, the code is very short, it is easy to understand the core of Guang search.)
无向图
- 无向图的创建,转化为邻接矩阵输出,及深度、广度优先遍历(The creation of undirected graph is transformed into adjacency matrix output and depth and breadth first traversal.)