搜索资源列表
BDFS
- 用邻接表表示无向图的深度优先搜索遍历 有助于大家理解图的优先遍历问题-adjoining table with no plans to the depth-first search traverse help you understand the plans of the priority issues Traversing
Win32Maze
- Win32下立体迷宫程序，含自动求解，可求迷宫最短路径和所有路径，分别用广度优先搜索和深度优先搜索两种方法实现，欢迎讨论。-Win32 three-dimensional maze procedure, including automatic solution Stepping maze shortest path and all trails. priorities were used to search breadth and depth-first search in two ways,
4.67
- 普里姆算法构造最小生成树，无向图的深度优先搜索。数据结构作业答案。老师写的-Primbetov minimum spanning tree algorithm structure, no plans to the depth-first search. Operating data structure answer. Teachers write! !
DFSearch
- 数据结构（C＋＋版）的演示程序，详细演示深度优先搜索的具体调用过程,-data structure (C + + version) demonstration program, a detailed demonstration of the depth-first search to the specific call process,
BFSearch
- 数据结构（C＋＋版）的演示程序，详细演示广度优先搜索的具体调用过程,-data structure (C + + version) demonstration program, a detailed demonstration of the breadth - first search specific call process,
BFS11223
- 该程序实现了 无向图的建立和广度优先搜索及输出-the program no plans to the establishment and BFS and output
TJU1103
- 同济大学ACM题库TJU1103的题解代码.深度优先搜索的一个好例子.-TJU1103 Tongji University ACM questions in the code that solution. Depth-first search of a good example.
Diagram
- 图的操作,包括,图的基本存储方法,有关图的操作算法并用C语言编程实现,图的搜索路径的遍历方法,以邻接矩阵和邻接表的方式存储连通图。然后分别用优先深度算法遍历邻接矩阵方式存储的图和邻接表方式存储的图。深度优先遍历的递归算法 （1）深度优先遍历算法（2）邻接表表示的深度优先搜索算法（3）邻接矩阵表示的深度优先搜索算法.-plan of operation, including, map the basic storage methods, the operation of the map algor
wide_search
- 广度优先搜索 c语言实现-BFS c Language
diwuci
- 1）掌握图的邻接矩阵、邻接表、十字链表、邻接多重链表存储结构表示及其创建算法的c语言实现； 2）掌握图的深度优先搜索遍历算法和图的广度优先搜索遍历算法及C语言实现；
graphopr
- 创建邻接矩阵 广度优先搜索 深度优先搜索
深度优先搜索
- 深度优先搜索二叉树-depth-first search Binary Tree
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
8shuma
- 八数码的问题描述，以及解答的源代码。用广度优先搜索-Eight digital descr iption of the problem, as well as answers to the source code. Using breadth-first search
BFS
- 广度优先搜索算法分析；供程序设计人员使用-Breadth-first search algorithm analysis for programmers to use
search_graph
- 一个python程序，实现了无向图的结构模拟，以及广度优先搜索的算法，以及显示最短路径之一。用leo+ulipad实现。-A python program to realize the structure of an undirected graph simulation, as well as the breadth-first search algorithm, and display one of the shortest path. By leo+ ulipad achieved.
KSE1.0(SRC)
- 数独探索者，快速解数独的小程序。使用哈希表优化的深度优先搜索算法。-Sudoku Explorer 1.0
6_7
- 实现数据结构 中图结构的邻接表存储结构算法，以及深度优先遍历算法。(The adjacency table storage structure algorithm for the graph structure in the data structure and the depth first traversal algorithm are realized.)
DFSMaze
- C++实现深度优先搜索迷宫，找到最短路径。(C++ implements the depth first search maze and finds the shortest path)
DFS
- 通过文件中的信息，进行搜索可达路径，行走过的正确路径标记为1，错误的路径标记为2(Through the information in the file, the search reachable path is searched, the correct path to walk is marked as 1, and the wrong path is marked 2)