当前位置：
首页 资源下载
搜索资源 - Breadth First Search
搜索资源列表
-
1下载：
在人工智能领域，对隐式图的搜索是求解问题的一种基本方法，本程序通过使用多种图搜索策略，对
重排九宫问题进行求解，演示了“广度优先搜索”、“深度优先搜索”、“有界深度优先搜索”、
“最好优先搜索”和“局部择优搜索”五种基本的图图搜索策略。
整个程序使用了动画技术，界面设计美观友好，使用方便。-In the field of artificial intelligence, implicit graph search is a basic method of solving proble
-
-
0下载：
POJ1112，动态规划，宽度优先搜索预处理-POJ1112, dynamic programming, breadth-first search for pre-
-
-
0下载：
这是我写的人工智能的九宫问题，用广度优先搜索实现，效率不高。-This is my problem writing artificial intelligence Nine-palace, with breadth-first search to achieve efficiency is not high.
-
-
0下载：
基于广度优先搜索解决TSP问题，可以删除，添加边和节点-TSP based on breadth-first search to solve the problem, you can delete, add edges and nodes
-
-
0下载：
从键盘输入无向图G的顶点个数v及边的个数e。建立有v个顶点、e条边构成的无向图G，采用邻接矩阵表示。V个顶点的值由键盘输入，元素类型为字符型。e条边的信息也由键盘输入。分别调用图的深度优先搜索、广度优先搜索图并输出相应的遍历序列。-Input from the keyboard without the number of vertices to the graph G v and the number of edges e. Establishment of a v vertices, e ed
-
-
0下载：
java 数据结构 实现图的广度优先算法-Data structure of breadth first search in java
-
-
0下载：
Program implements graphs algorihtms to solve fifteen puzzle problem (http://en.wikipedia.org/wiki/Fifteen_puzzle). There are few methods BFS - Hamming and Manhattan heuristics, Breadth-first search and Depth-first search. You can implement A* algori
-
-
0下载：
广度优先搜索及深度优先搜索，用C语言实现，比较使用-Breadth-first search and depth first search, using C language, compared with
-
-
0下载：
some useful little program for new learner
Graph Alg.:Red-Black tree,Dijkstra s algorithm,Depth first search and breadth first search.
Heaps:Fibonacci heap source..
Sorting:Various array sorting algorithms..
Searching:Array searching algorith
-
-
0下载：
基于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
-
-
0下载：
求解最大连通区域 一个简单的广度优先搜索算法-Solving the biggest connected region with a simple breadth-first search algorithm
-
-
0下载：
利用深度优先搜索、广度优先搜索和启发式搜索解决8数码问题，效率各有不同-Use depth-first search, breadth-first search and heuristic search to solve 8 digital issues, different efficiency
-
-
0下载：
Breadth First Search
-
-
0下载：
以邻接矩阵或邻接表为存储结构，以用户指定的顶点为起始点，实现无向连通图的深度优先及广度优先搜索遍历，并输出遍历的结点序列-The adjacency matrix or adjacency list for the storage structure to user-specified vertex as a starting point to achieve a connected undirected graph of the depth-first and breadth-first se
-
-
0下载：
图的遍历(含深度优先搜索与广度优先搜索，主函数)-Graph traversal (depth-first search and breadth-first search)
-
-
0下载：
数据结构 图的广度优先搜索遍历路径源代码-Data structure of the breadth-first search through the source code path
-
-
0下载：
广度优先搜索算法，是搜索算法的一种，内附实例-The breadth-first search algorithm
-
-
0下载：
华容道的广度优先搜索求解——散列查找和启发式搜索的应用-The game hua-rong-dao breadth first search solution-hash search and heuristic search application
-
-
0下载：
人工智能经典问题八数码的广度优先搜索算法实现。没有图形界面。-Classic problem of artificial intelligence, eight digital breadth-first search algorithm. No graphical interface.
-
-
0下载：
图的遍历，两种遍历，深度优先搜索遍历和广度优先搜索遍历算法-Traversal of the graph traversal, two traversal, depth-first search and breadth-first search traversal algorithm
-
«
1
2
3
4
5
6
78
9
10
11
12
...
15
»
