Pagini recente » Cod sursa (job #2140106) | Cod sursa (job #433676) | Cod sursa (job #2283951) | Cod sursa (job #2422245) | Cod sursa (job #1430857)
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Scanner;
import java.util.Stack;
public class Main {
static int [][] adjMat;
static int n;
static int [] visited;
public Main(int n){
this.n = n;
adjMat = new int[n+1][n+1];
visited = new int[n+1];
}
static void dfs(int source){
visited[source] = 1;
for (int i = 1; i <= n; i++) {
if(visited[i] == 0 && adjMat[source][i] == 1){
System.out.println("am gasit " + i + " nevizitat");
dfs(i);
}
}
}
public static void main(String[] args) throws IOException {
Scanner in = new Scanner(new FileReader("dfs.in"));
int n =in.nextInt();
int m = in.nextInt();
int k=0,x,y;
Main main = new Main(n);
for (int i = 0; i < m; i++) {
x = in.nextInt();
y = in.nextInt();
adjMat[x][y] = 1;
adjMat[y][x] = 1;
}
in.close();
for (int i = 1; i <= n; i++) {
if(visited[i] == 0){
System.out.println("Apelex dfs din: " + i);
dfs(i);
k++;
}
}
BufferedWriter out = new BufferedWriter(new FileWriter("dfs.out"));
out.append(k + "\n");
out.close();
}
}