搜索资源列表
shujujiegou
- 设计程序完成如下功能：对给定的图结构和起点，产生所有的深度优先搜索遍历序列，并给出求解过程的动态演示。 说明：可以用实验工具中的有关功能。
1
- 1.建立一个无向图的邻接表存储 2。对该图进行深度优先搜索，按顺序输出所访问的-1. The establishment of an undirected graph in adjacency list is stored 2. Depth-first search of the graph, according to the order of the output of the visit
3
- 设计一个有向图和一个无向图，任选一种存储结构，完成有向图和无向图的DFS（深度优先遍历）和BFS（广度优先遍历）的操作。-Design of a directed graph and an undirected graph, either type of storage structure, the completion of a directed graph and an undirected graph of the DFS (depth-first traversal) and BFS (
graphy
- C++ 关于图的广度优先 深度优先 遍历的一些代码 很不错-C++ on the graph breadth-first depth-first traversal of some of the code is very nice
Graph
- 1．建立无向网的邻接矩阵。 要求：从键盘输入无向网的顶点数和边数；然后以“顶点1，顶点2，权值”的方式输入图的各边，建立邻接矩阵存储，并输出各顶点和邻接矩阵。 2．对无向网进行深度优先遍历，输出遍历序列。 3.判断给定的无向网是否是连通的？ 要求：从键盘上输入出发点进行搜索遍历，输出遍历序列。 -1. The establishment of the network adjacency matrix. Requirements: No input from the ke
shenduyouxiansuanfa
- 用于树目录或图层的深度优先算法，用C #编写-Directory for the tree depth-first algorithm, written using C#
DataStructure8
- Java数据结构第七课：图的实现。包括初始化图，添加边，删除边，及深度优先遍历和广度优先遍历算法。-Java Data Structure Lesson: Figure of the implementation. Including the initialization graph, add edge, remove edge, and depth-first traversal and breadth-first traversal algorithm.
Graph
- 该程序是用MFC实现的图的相关的运算，其中包括了图的深度有限遍历，广度优先遍历，最短路径等基本运算。-The program is MFC implementation of graph-related operations, including the depth chart limited traversal, breadth-first traversal, shortest path, and other basic operations.
bianli
- 用邻接矩阵确定图 输出深度优先遍历和广度优先遍历的结果-Map with the adjacency matrix to determine the depth first traversal and breadth of the output first traversal of the results
graphoperation
- 根据从键盘输入的数据创建图（图的存储结构可采用邻接矩阵或邻接表），并对图进行深度优先搜索和广度优先搜索（实验类型：验证型） 1）问题描述：在主程序中提供下列菜单： 1…图的建立 2…深度优先遍历图 3…广度优先遍历图 0…结束 2）实验要求：图的存储可采用邻接表或邻接矩阵；定义下列过程： CreateGraph(): 按从键盘的数据建立图 DFSGrahp()：深度优先遍历图 BFSGrahp()：广度优先遍历图-According to dat
Graphtraversal
- 输入给定的有向图或无向图实现深度优先遍历和广度优先遍历-Graph Traversal
11
- 关于图结构的深度优先搜索遍历。。。输出搜索的遍历序列-On the graph structure of the depth-first search traversal. . . Output search traversal sequence. .
graph-traversal
- 图的深度与广度优先遍历小程序源码，均为个人所编，并非网上下载。-The depth and breadth-first graph traversal
main
- 已知图采用邻接表存储，写出深度优先搜索算法的非递归形式 对邻接表存储的图采用非递归的深度优先搜索 该程序只适合有向连通图，可以用邻接表这样的一个图进行测试-Figure adjacency list is stored to write a depth-first search algorithm non-recursive form of Adjacency list stored in the diagram using non-recursive depth-first sea
tubianli
- 图的广度优先和深度优先遍历，首先创建图，然后输出遍历序列-Figure of the breadth and depth of priority priority to traverse, first create figure, and then the output to traverse sequence
sicily
- 关于图的广度优先搜索和深度优先搜索算法，结构体描述。还有二叉树的重建，根据先序和中序重构二叉树-DFS and BFS
_
- 图运算 在邻接矩阵存储结构上实现图的深度和广度优先遍历算法-Figure computing adjacency matrix storage structure diagram of the depth and breadth-first traversal algorithm
bianli
- 数据结构中图的遍历。通过手动输入，采用邻接矩阵创建无向图，再通过计算，完成对该图进行土的深度优先遍历。-Graph traversal of the data structure. By manually entering the adjacency matrix to create an undirected graph, by calculating the complete depth-first traversal of the soil of the graph.
Graph
- 1、创建一个无向图，采用邻接矩阵存储，顶点采用单个字符表示，边采用邻接矩阵表示； 2、输出该图的存储示意图； 3、对该图进行深度优先遍历和广度优先遍历并输出遍历的结果。 -1, create an undirected graph adjacency matrix storage vertex edges using adjacency matrix representation with a single character 2, the output of the storag
matlab
- 图论中经常用到的深度优先搜索法 经常用在电力系统的可靠性的解列运算当中-Depth-first search method often used in graph theory is often used in the reliability of the power system splitting operator which