搜索资源列表
Binary-Tree
- 对二叉树进行操作，包括二叉树的创建和对二叉树进行深度和广度优先遍历-Operations, including the creation of a binary tree, and the depth and breadth-first traversal of a binary tree on binary tree
adjacency-list
- 基于邻接表表示的图的遍历包括深度优先遍历和广度优先遍历-Based on the adjacency list representation of the graph traversal, including the depth-first and breadth-first traversal
traversal
- 以邻接表作为图的存储结构，实现连通无向图的深度优先遍历及广度优先遍历。-As the storage structure of the table adjacent to the connected undirected graph depth-first traversal and breadth-first traversal.
breadth-first-traversa
- 严蔚敏《数据结构》无向图的广度优先遍历算法c++代码实现-Yan Wei-min data structure undirected graph breadth-first traversal algorithm c++ code to achieve
tu
- 分别写出用邻接矩阵和邻接表做图的存储结构，并分别实施广度优先遍历和深度优先遍历。-Write down made graph adjacency matrix and adjacency list storage structure, and implement the depth-first traversal and breadth-first traversal
tu
- 分别以邻接表、邻接矩阵为存储结构，实现图的深度优先和广度优先遍历，分别输出每种遍历下的节点访问序列。-Respectively adjacent table, the adjacency matrix for the storage structure, to achieve depth-first and breadth-first traversal, respectively, each output node access under traversal sequence.
s6
- 数据结构 在图G中求一条从顶点i到顶点s 的简单路径。 实验目的： 1、掌握图的各种存储结构，尤其熟练掌握邻接矩阵和邻接表存储结构； 2、熟练掌握图的深度优先遍历和广度优先遍历算法； 3、在遍历算法的基础上设计其他应用算法。 -Data structures and seek a graph G from vertex i to vertex s simple path. Experiment: a master chart of the various storage
01174033
- （1）构造一个具有n个顶点的无向图或有向图。 （2）输出以深度优先遍历和广度优先遍历后的顶点序列。-(1) with n vertices construct a undirected graph or digraph. (2) Output to depth-first traversal and breadth-first traversal sequence of vertices after.
deepabreadth
- 二叉树的深度优先遍历和广度优先有限遍历，包括生成和遍历。-Binary tree depth-first and breadth-first traversal limited traversal, including the generation and traversal.
traverse-of-graphs
- 利用邻接矩阵或邻接表存储一张图，分别采用图的深度优先搜索和广度优先搜索遍历该图，并输出遍历结果-Using the adjacency matrix or adjacency list storage a picture, using depth-first search and the breadth first search traversal of the graph, and the output traversal results
work5_1
- 无向图的遍历，深度优先遍历，广度优先遍历。-Undirected graph traversal, depth-first traversal, breadth-first traversal.
graph
- 1. 分别以邻接矩阵和邻接表的存储结构建立图。 2. 分别对图进行深度优先遍历和广度优先遍历。 3. 求图中边的数目。 4. 求顶点0到图中其余每个顶点的最短路径。 -1, respectively, the adjacency matrix and adjacency list storage structure created map. 2, respectively, the graph depth-first traversal and breadth-fir
Adjacency-matrix
- 分别以邻接矩阵和邻接表的存储结构建立图。 分别对图进行深度优先遍历和广度优先遍历。 求图中边的数目。 求顶点0到图中其余每个顶点的最短路径-Respectively adjacency matrix and adjacency list storage structure created map. Respectively graph depth-first traversal and breadth-first traversal. In the figure, the numbe
bianli
- 这是图的深度优先遍历和广度优先遍历算法，可以改变结点数和边数-This is illustrated in the depth-first traversal and breadth-first traversal algorithm, you can change the number of nodes and edges
puzzlewidth
- 9格宫数字进行排序，随机打乱顺序，可以完成0-8数字的正确排序，采用广度优先搜索进行遍历-9 palace digital sorting, random order, can be completed the correct sequence of 0 to 8 Numbers, traverse using breadth-first search
BFSPDFS
- 广度优先搜索和深度优先搜索在网络拓扑图上的实现。广度优先搜索是从某一节点开始，搜索与其线连接的所有节点，按照广度方向像外扩展，直到不重复遍历所有节点；深度优先搜索是从某一节点开始，沿着其搜索到的第一个节点不断深入下去，当无法再深入的时候，回溯节点，然后再在回溯中的某一节点开始沿另一个方向深度搜索，直到不重复的遍历所有节点。 -Breadth-first search and depth-first search in the network topology is realized. Bre
tu
- 1. 建立并显示图的邻接矩阵。 2. 建立并显示图的邻接表。 3. 实现图的深度优先和广度优先遍历。 4. 编写测试程序。 -(1) Establishment and display the adjacency matrix. (2) create and display the adjacency table. 3 to achieve depth-first and breadth-first traversal. 4. Preparation of test
Graph
- 输入一个带权无向图的顶点数、边数、各条边信息（两个顶点和权值），建立该图的邻接矩阵结构，输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构，输出该邻接表；根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列，并输出遍历结果；用prim算法实现构造该带权无向图的最小生成树，并将该最小生成树的各条边信息输出。-Enter a weighted undirected graph with vertices, edges, each of the side information (two ve
Experimental-binary-tree-traversal
- 二叉树的创建及遍历实验 要求：数据元素类型ElemType取float。 1）从键盘按照前序遍历的顺序依次输入二叉树的各元素，创建此二叉树。 2）对该二叉树进行层次遍历，并输出遍历后的序列。(参照图的广度优先搜索)-Binary tree traversal create and test requirements: data element types ElemType take float. 1) from the keyboard in accordance with the
graph-DFS
- 邻接表存储图，然后进行深度优先遍历及广度优先遍历。-DFS,adjacent matrix