搜索资源列表
Handout
- 创建图的邻接表存储结构,输出邻接表数据(验证创建过程),深度优先遍历(DFS) ,广度优先遍历(BFS),增加一个顶点到图, 删除一个顶点(同时删除其所有邻接边) ,增加一条弧到图,从图中删除一条弧- Creating adjacency table storage structure, the output adjacency table data (validation creation process), depth-first traversal (DFS), breadth-fi
tu
- 图的深度优先与广度优先遍历 利用邻接矩阵或邻接表作为存储结构建立一个无向图,每个顶点中存放一种水果名(例如apple、orange、banana等,并要求从键盘输入),顶点数不少于5个。要求分别以深度优先搜索(DFS)和广度优先搜索(BFS)进行遍历,输出遍历结果。 -Depth-first and breadth-first traversal Adjacency matrix or adjacency list use as
BFS
- 该代码实现了基于邻接表的深度优先遍历和广度优先遍历,并包含求图的割点的算法,可以在VS2010下直接运行。-The code implement the BFS and DFS of graph based on adjacence list.It includes the algorithm that find all articulated node. It can run in the environment of VS2010.
code
- 深度优先遍历算法 深度优先搜索算法 DFS算法 图论的一个算法-Depth-first traversal algorithm depth-first search algorithm DFS algorithm is an algorithm in graph theory
CPPAlgorithm-examples
- 好用的c++算法实现,对图论,DFS框架,排序等算法的学习非常有用-Easy to use c++ algorithms, graph theory, DFS frame, sorting algorithms, such as learning useful
GrahpDFS
- 不使用递归算法,使用栈和队列,事项图的深度遍历-Graph DFS
shotestpath1.c
- graph algorithms bfs and dfs
Connect-Set
- 网易云课堂-陈越、何钦铭-数据结构-2016春 PTA-06-图1 列出连通集 给定一个有NNN个顶点和EEE条边的无向图,请用DFS和BFS分别列出其所有的连通集。假设顶点从0到N− 1N-1N− 1编号。进行搜索时,假设我们总是从编号最小的顶点出发,按编号递增的顺序访问邻接点。-Given a free E N vertices and edges of the graph, please list the set of all of its communicat
graph_lin
- 数据结构以及算法实现 图的创建 深搜、广搜、最短路-(1).print the graph. (2).print the sequence of vertex names getting Depth-First Search. (3). print the sequence of vertex names getting Breadth-First Search. Dfs Bfs dijkstra
undigraph
- 图的数据结构相关实验,包括无向图的创建及图的BFS,DFS深度遍历,可进行最短路径的算法有最小生成树(It includes the creation of an undirected graph and the BFS, DFS depth traversal of the graph, and the shortest path algorithm has the minimum spanning tree)