public static void dfs(boolean[][] nabomatrise, boolean[] visited, int node) {
		visited[node] = true;
		for (int i = 0; i < nabomatrise[node].length; i++) {
			if(nabomatrise[node][i] == true && !visited[i]) {
				dfs(nabomatrise, visited, i);
			}
		}
	}