一、计算无向图的连通分量个数
import java.util.Scanner;
/**
* 计算图的连通分量
*/
public class ConnectedComponent {
static int N,M;
static int[] visit;
static int[][] map;
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
N = scan.nextInt(); // 图的定点个数
M = scan.nextInt(); // 图的边个数
map = new int[N][N]; // 无向图
visit = new int[N]; // 顶点n是否被访问过
int a,b;
for (int i = 0; i < M; i++) {
a = scan.nextInt();
b = scan.nextInt();
map[a][b] = 1;
map[b][a] = 1;
}
System.out.println(getConnectedComponents());
}
public static int getConnectedComponents() {
int res = 0;
for (int i = 0; i < N; i++) {
if(visit[i] == 0) { // 如果i未被访问过,连通分量+1,进行新的一轮dfs
res++;
dfs(i);
}
}
return res;
}
public static void dfs(int v) { // 从某个顶点开始dfs
visit[v] = 1;
for (int i = 0; i < N; i++) { // dfs每个连通的顶点
if(map[v][i] == 1&& visit[i]==0) {
dfs(i);
}
}
}
}