05-图1. List Components (25)

最新推荐文章于 2022-03-21 21:38:23 发布

Ace_XK

最新推荐文章于 2022-03-21 21:38:23 发布

阅读量1.3k

点赞数

分类专栏： PAT 文章标签：图 DFS BFS

本文链接：https://blog.csdn.net/xkzju2010/article/details/46427295

版权

这篇博客介绍了一种在给定无向图中使用深度优先搜索(DFS)和广度优先搜索(BFS)列出所有连通组件的方法。从最小索引的顶点开始，并按索引升序访问相邻顶点。输入规格包含顶点数和边数，以及每条边的两个端点。输出格式分别按DFS和BFS顺序显示连通组件。

摘要由CSDN通过智能技术生成

For a given undirected graph with N vertices and E edges, please list all the connected components by both DFS and BFS. Assume that all the vertices are numbered from 0 to N-1. While searching, assume that we always start from the vertex with the smallest index, and visit its adjacent vertices in ascending order of their indices.

Input Specification:

Each input file contains one test case. For each case, the first line gives two integers N (0<N<=10) and E, which are the number of vertices and the number of edges, respectively. Then E lines follow, each described an edge by giving the two ends. All the numbers in a line are separated by a space.

Output Specification: