搜索资源列表
-
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
-
-
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下载：
图的深度优先搜索和广度优先搜索以及一个无向图的拓扑排序-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 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.
-
