搜索资源列表
graph-1
- 关于图的一些操作，包括判断连通，深度优先遍历算法，求单源最短路径-For some operations, including the judgment connectivity, depth-first traversal algorithm, find the single source shortest path
linjiejuzhen
- 能够输入输出一个图的邻接矩阵，能够对相应的边和顶点进行插入删除操作，能够进行深度和广度优先搜索遍历-The adjacency matrix of a graph can be input and output, insertion and deletion operations to the corresponding edges and vertices, depth and breadth-first search traversal
1130
- 用邻接表创建图的函数,输入完毕后请用深度优先遍历的方法输出顶点序列。-Adjacent table to create a graph with a depth-first traversal function, after entering the output sequence of vertices.
Graph-traversal
- 图的两种遍历方式：深度优先遍历、广度优先遍历。-Figure two traversal way: depth-first traversal, breadth-first traversal.
Depth-first-traversal
- 1、编写图的邻接表表示法的数据结构。 2、编写用邻接表创建图的函数 3、用深度优先遍历的方法输出顶点序列-1, write the adjacency table shows the data structure of the Act. 2, written with the adjacent table to create a graph function output sequence of vertices with a depth-first traversal methods
062
- 有向图的邻接表存储表示，并进行深度和广度优先遍历-To the adjacency table storage, and the depth and breadth-first traversal
main
- 图的邻接链表存储和遍历，C语言课程设计大作业，包括广度优先和深度优先。-The adjacency lists storage and traversal, C language curriculum design operations, including the breadth-first and depth-first.
data
- 图的链式表示，深度优先、广度优先算法，Dijkstra算法,包括源码程序和ppt所以对学习数据结构很有帮助-Figure chain, depth-first and breadth-first algorithm, Dijkstra algorithm, including the source program and ppt so helpful learning data structures
tree
- 数据结构，图的遍历，深度优先遍历，广度优先遍历。-Data structures, graph traversal, depth-first traversal, breadth-first traversal.
adjacency-list
- 基于邻接表表示的图的遍历包括深度优先遍历和广度优先遍历-Based on the adjacency list representation of the graph traversal, including the depth-first and breadth-first traversal
dfs-final-tidai
- 深度优先遍历,可以求出图中任意一点出发遍历整个图的路径-depth first search
tu
- 分别写出用邻接矩阵和邻接表做图的存储结构，并分别实施广度优先遍历和深度优先遍历。-Write down made graph adjacency matrix and adjacency list storage structure, and implement the depth-first traversal and breadth-first traversal
DFStu.cpp
- 这份代码是一个深度搜索图的实例代码，但是效率不是很高，只能实现深度优先的遍历-The code is written for DFS to search for the answers! enjoy it please everybody.I use this stage at the first time.
graph
- 连通图的遍历（深度优先算法）求2个城市的最短距离，以及任何一条最短的路径-Connected graph traversal (depth-first algorithm) Find the shortest distance two cities, as well as any one shortest path
5_16
- 1.有向图的邻接表的建立，以及拓扑排序2.无向图邻接矩阵的建立，及其深度优先搜索和广度优先搜索-1 directed graph adjacency table creation, as well as topological sorting 2. Undirected graph adjacency matrix creation, and its depth-first search and breadth-first search
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.
graphDFS
- 图的 DFS算法 深度优先算法 采用模板类实现 数据结构中的经典算法-DFS algorithm graph depth-first algorithm uses a template class that implements the data structure of the classical algorithm
work5_1
- 无向图的遍历，深度优先遍历，广度优先遍历。-Undirected graph traversal, depth-first traversal, breadth-first traversal.
4
- 设无向图G有n个点e条边，编写算法建立G的邻接表，并按照深度优先搜索输出顶点间。-Let undirected graph G with n vertices e edges, G to write algorithms to establish the adjacency table, and depth-first search in accordance with the output vertex requires time complexity of the algorithm is
data
- 本算法是利用深度优先算法求图的全部割点，此外，也可以判断该图是否存在割点。-This algorithm is the use of depth-first algorithm for drawing all the cut points, in addition, can also determine whether the figure cut point.