给定一个有N个顶点和E条边的无向图,请用DFS和BFS分别列出其所有的连通集。假设顶点从0到N−1编号。进行搜索时,假设我们总是从编号最小的顶点出发,按编号递增的顺序访问邻接点。
输入格式:
输入第1行给出2个整数N(0<N≤10)和E,分别是图的顶点数和边数。随后E行,每行给出一条边的两个端点。每行中的数字之间用1空格分隔。
输出格式:
按照"{ v1 v2 … vk }"的格式,每行输出一个连通集。先输出DFS的结果,再输出BFS的结果。
输入样例:
8 6
0 7
0 1
2 0
4 1
2 4
3 5
输出样例:
{ 0 1 4 2 7 }
{ 3 5 }
{ 6 }
{ 0 1 2 7 4 }
{ 3 5 }
{ 6 }
#include<iostream>
#include<queue>
using namespace std;
int N,E;
int G[10][10]; //邻接矩阵
int inq[10];
int vis[10];
void dfs(int x)
{
vis[x] = 1;
cout<<x<<" ";
for(int i = 0; i < N; i++){
if(vis[i] == 0 && G[x][i] == 1){
dfs(i);
}
}
return ;
}
void bfs(int x) //广度优先搜索
{
inq[x] = 1;
queue<int>q;
q.push(x);
while(!q.empty())
{
int temp = q.front();
q.pop();
cout<<temp<<" ";
for(int i = 0; i < N;i++){
if(inq[i] == 0 && G[temp][i] == 1){
q.push(i);
inq[i] = 1;
}
}
}
}
int main()
{
cin>>N>>E;
for(int i = 0; i < N; i++)
for(int j = 0;j < N; j++)
G[i][j] = 0;
int x,y;
for(int i = 0; i < E; i++){
cin>>x>>y;
G[x][y] = 1;
G[y][x] = 1;
}
for(int i = 0; i < N; i++) vis[i] = 0;
for(int i = 0; i < N; i++){
if(vis[i] == 0){
cout<<"{ ";
dfs(i);
cout<<"}"<<endl;
}
}
for(int i = 0; i < N; i++) inq[i] = 0;
for(int i = 0; i < N; i++){
if(inq[i] == 0){
cout<<"{ ";
bfs(i);
cout<<"}"<<endl;
}
}
return 0;
}
java代码
import java.util.LinkedList;
import java.util.List;
import java.util.Scanner;
public class Main {
static final int N = 11;
static int[][] G = new int[N][N];
static int vis[] = new int[N];
static int inq[] = new int[N];
static int n;
static Scanner sc = new Scanner (System.in);
static void dfs(int x) {
vis[x] = 1;
System.out.print(" " + x);
for(int i =0 ; i < n; i++) {
if(vis[i] != 1 && G[x][i] == 1) {
dfs(i);
}
}
}
static void bfs(int x) {
inq[x] = 1;
LinkedList<Integer> q = new LinkedList<Integer>();
q.add(x);
while(!q.isEmpty()) {
int temp = q.removeFirst();
System.out.print(" " + temp);
for(int i = 0; i < n; i++) {
if(inq[i] != 1 && G[temp][i] == 1) {
q.add(i);
inq[i] = 1;
}
}
}
}
public static void main(String[] args) {
n = sc.nextInt();
int e = sc.nextInt();
for(int i = 0; i < e; i++) {
int c1 = sc.nextInt();
int c2 = sc.nextInt();
G[c1][c2] = G[c2][c1] = 1;
}
for(int i = 0; i < n; i++) {
if(vis[i] != 1) {
System.out.print("{");
dfs(i);
System.out.println(" }");
}
}
for(int i = 0; i < n; i++) {
if(inq[i] != 1) {
System.out.print("{");
bfs(i);
System.out.println(" }");
}
}
}
}