搜索资源列表
maze dfs
- dfs 深度优先搜索!这是走迷宫的基本算法。用广义表建立迷宫,用邻接表建立图,用dfs搜索,许多大学的数据结构作业-dfs depth-first search! Maze This is the basic algorithm. Generalized Table established maze, with the establishment of the adjacent table map, with dfs search, the University of many data str
5班8号周前平
- 输入一个有向图,用深度优先搜索,判断该图是否为一有圈的图。-importation of a directed graph, with the depth-first search to determine whether the plan is a map of the circle.
sortling
- 实现图的脱坡排序,深度优先广度优先,以及建立邻接表-achieve slope from the map, in order of priority depth breadth priority, and the establishment of the adjacent table
haokan
- 试扩充深度优先搜索算法,在遍历图的过程中建立生成森林的左子女-右兄弟链表。算法的首部为 void Graph::DFS ( const int v, int visited [ ], TreeNode<int> * t ) 其中,指针t指向生成森林上具有图顶点v信息的根结点。(提示:在继续按深度方向从根v的某一未访问过的邻接顶点w向下遍历之前,建立子女结点。但需要判断是作为根的第一个子女还是作为其子女的右兄弟链入生成树。) -try to expand the depth-fir
tudeshixian
- 无向图的实现和深度优先算法-no plans to the realization of the depth and priority algorithm
graphSearch
- 实现了图的搜索算法,包括深度优先搜索,广度优先搜索,Dijstra算法,A*算法等较典型的搜索算法,同时可以进行图的输入和编辑等操作,仅供大家参考。-achieve the plan's search algorithm, including depth-first search, breadth - first search algorithm Dijstra, A * algorithm is more typical search algorithm, and can map th
GraphMatrix
- 以邻接矩阵作为图的存储结构,根据键盘输入创建图,并深度优先、广度优先遍历该图-matrix as to the adjacent storage structure of the plan, according to the keyboard input to create map and depth of priority, breadth priority traversal of the plan
asdfasxa32
- 掌握图的邻接矩阵的存储结构;实现图的两种遍历:深度优先遍历和广度优先遍历。-master plan adjacency matrix storage structure; Implementation plans of the two traverse : depth-first traversal and breadth traversal priority.
GOOD_DFS_BFS
- 图论中二种遍历图的算法.深度优先遍历,与广度优先遍历.-graph theory two species traverse map algorithm. Depth-first traversal, and the breadth - first traversal.
operate
- 1,图的建立与遍历操作 建立图的邻接矩阵 输出图从顶点V0出发按深度优先遍历的顶点序列 输出图从顶点V0出发按广度优先遍历的顶点序列 2,图的建立与拓扑排序-1, Graph traversal operation with the establishment of the establishment of the adjacency matrix output plans starting from the vertex V0 by depth-first traversal
2007char
- 利用邻接矩阵的图深度优先遍历算法,调试通过,无毒!-use of adjacency matrix plans depth-first search algorithm, through testing, drug-free!
2007char2
- 利用邻接表的图深度优先遍历算法,调试通过。无毒-use adjacent table plans depth-first traversal algorithm, through debugging. Nonpoisonous
grapher
- 用图形用户界面表示的图,数据结构基本应用,最小生成树算法,最短路径,广度、深度优先搜索-graphical user interface with the plan said, the basic data structure application, the minimum spanning tree algorithm, the shortest path, breadth, depth-first search
l
- 7_4无向图深度优先生成树和广度优先生成树 数据结构算法的实现
shengdubianli
- 1.首先选定图的类别(有向图、无向图),再选定图的存储结构,根据输入的顶点或者边建立图;并把相应的邻接表或者邻接矩阵输出; 2.根据已有的邻接矩阵或邻接表用递归方法编写深度优先搜索遍历算法,并输出遍历结果;
5
- 图的遍历中,因为图的任一顶点都可能与其余的顶点相邻接,所以在访问了某个顶点之后,可能沿着某条路径搜索之后又回到该顶点上。为了避免同一顶点被访问多次,在遍历图的过程中必须记下每个已访问过的顶点。深度优先搜索从图的某个顶v点出发,访问此顶点,然后依次从v的未被访问的邻接点出发深度优先遍历图。遍历图的过程实质上是对每个顶点查找其邻接点的过程。其耗费的时间则取决于所采用的存储结构。
lab
- 要求建立图的邻接表存储结构,输入或存储任意一个无向图,显示图的深度优先搜索遍历路径(非递归)和广度优先搜索遍历路径。- U8981 u5E8 u5E8 u5E8 u6EF u6EF u4E00 u4E2A u65E0 u653 U56FE uFF0C u663E u793A u56FE u7684 u6DF1 u5EA6 u4F18 u5148 u641C u7D22 u904D u5386 u8DEF u5EA U5138 u641C
Lin
- 编写程序以邻接矩阵、邻接表两种方式存储指定连通图,并输出存储之后的图。 用深度优先算法和广度优先算法遍历邻接矩阵方式存储的图和邻接表方式存储的图。(The program stores the designated connected graphs in two ways of adjacency matrix and adjacency list, and outputs the graph after storage. Using depth first and breadth firs
Globalpath
- 通过深度优先遍历的图搜索方式,从邻接矩阵中搜索全局路径(Searching the global path from the adjacency matrix through the search method of depth first traversal of the graph)
第五次作业
- 输入或存储任意一个无向图,显示图的深度优先搜索遍历路径和广度优先搜索遍历路径。 要求: 1)基于图的邻接表存储结构实现。 2)基于图的邻接矩阵存储结构实现。(Input or store any undirected graph to show the depth first search traversal path and breadth first search traversal path of the graph Requirement 1 the implement