搜索资源列表
maze
- 迷宫问题，分别用深度和广度优先遍历解决。其中stack用链表实现，queue用数组实现。描述见pdf文件。-Maze problems, were the depth and breadth of priority traversal solution. Stack with the achievement of which list, queue to use the array to achieve. Descr iption see pdf file.
612109301
- 要求采用邻接矩阵作为无向图的存储结构，邻接表作为有向图的存储结构，完成无向图和有向图的建立，并对建立好的图进行深度和广度优先遍历。具体实现要求： 1. 通过键盘输入图的顶点和边信息，分别构造一个无向图的邻接矩阵和一个有向图的邻接表。 2. 分别对建立好的两个图进行深度和广度优先遍历，输出相应的遍历序列。 3. 统计两个图的连通分量的个数。 -Require the use of adjacency matrix as the storage structure of an und
eight-figure-puzzle
- 八数码难题用Java语言实现，搜索算法为广度优先-eight-figure-puzzle in Java
grapher
- 深度优先，广度优先，最短路径，最小生成树的图形演示以及源代码-Depth-first, breadth-first, shortest path, minimum spanning tree, as well as graphical presentation source
ScreenSpy
- 广度优先搜索变化的屏幕传输算法，就是小牛所谓的正态分布算法 算法很简单，去掉注释，自己冥想吧-Breadth-first search algorithm changes in the screen transfer, that is, the so-called normal distribution algorithm Mavericks algorithm is very simple, remove the comments, his meditation Bar
1
- 这个程序是从广度优先搜索,深度优先搜索,A算法以及A算法等多方面算法来解决八数码问题-This program is breadth-first search, depth-first search, A algorithm and A algorithm and many other algorithms to solve the problem of digital 8
BroadSearch
- 实现了8数码问题，用的是广度优先搜索算法,广度优先算法属于盲目搜索，效率不高-eight_num problem
DeepSearch
- 实现八数码问题的深度优先搜索算法，这是一种盲目搜索，搜索效率比广度优先搜索还低，这个算法实现有一定的难度-Search
guangduyouxiansousuomigong
- 用广度优先搜索实现的搜索走迷宫最短路径，可以帮助理解广度优先搜索-Breadth-first search using the search Maze to achieve the shortest path that can help understand the breadth-first search
Maze
- 神奇的迷宫小游戏，包含有迷宫自动生成的算法，实现了“左手摸墙”算法，深度优先，广度优先搜索算法，以自动寻路。-Magic maze game maze includes automatic generation algorithm, to achieve a " left hand touching the wall" algorithm, depth first, breadth-first search algorithm to automatically find its
graph
- 实现图的深度优先遍历和图的广度优先遍历的控制台应用程序-Graph depth-first traversal and graph breadth-first traversal of the console application
bfstraverse
- 能够输入节点 然后完成图的广度优先遍历-Able to enter the node and then complete the graph breadth-first traversal
graphsearch
- 包含图的深度优先探索遍历和广度优先探索遍历，能从图中的任一顶点出发访问图中所有顶点-Includes plans to explore the depth-first traversal and breadth-first traversal to explore, from the graph the starting point of any visit to Figure 1 for all vertices
guangduyouxiansuanfa
- 广度优先算法 很全的 希望你会喜欢 -Breadth-first algorithm is very wide of the hope that you will love
graph_
- //有向图:有向图,无向图基本操作 //运行环境：VC //有向图,无向图基本操作,包括: //1、邻接矩阵 //2、邻接表 //3、深度优先遍历 //4、广度优先遍历 //5、最小生成树 //6、拓扑排序 //7、每一对顶点之间的最短路径（Dijkstra,Floyd两种算法）-//Directed graph: directed graph, undirected graph basic operation// Operating Environme
BFSTraverse
- 图的遍历_邻接表存储.cpp 检验深度优先和广度优先的程序(邻接表存储表示)-Graph traversal _ adjacent table storage. Cpp test the depth and breadth of the priority of priorities Procedure (adjacent table, said storage)
f.doc
- 题目1：图的建立与遍历；连通网的最小生成树生成实现。 内容： 1） 用邻接表表示方法建立图1所示图的存储结构，用邻接矩阵存表示方法建立图2所示网的存储结构。 2） 在图1 存储结构（邻接表）上实现深度优先搜索遍历和广度优先搜索遍历，并给出遍历结果（序列）。 3） 按照普里姆算法，在图2所示连通网的存储结构（邻接矩阵）上实现此网的最小生成树，并输出生成树。 -Title 1: Map of the establishment and ergodicity conne
Graph
- 本程序实现图的深度优先和广度优先遍历，本程序调试无误，可在vc6.0环境中编译成功！-This procedure to achieve graph depth-first and breadth-first traversal, the program debugging accurate, can be successfully compiled vc6.0 environment!
aa
- 九宫问题的深度和广度优先算法-Nine-palace the issue of the depth and breadth of the priority algorithm
wumpusworld
- Wumpus World 是一个世界出名的游戏,在给定的一个nxm的格子中以最快的方式找的黄金而避开Wumpus.这个程序采用广度优先遍历的方法-Wumpus World is a famous game. In this project, we want to find the gold as quick as possible.We implement Breadth First Search in it.