Keys and Rooms LeetCode solution in JavaScript

1
function dfs(current, all, visited) {
2
  if (visited.size == all.length) {
3
    return true;
4
  }
5
  for (let i = 0; i < all[current].length; i++) {
6
    if (!visited.has(all[current][i])) {
7
      visited.add(all[current][i]);
8
      if (dfs(all[current][i], all, visited)) return true;
9
    }
10
  }
11
  return false;
12
}
13
var canVisitAllRooms = function (rooms) {
14
  let visited = new Set();
15
  visited.add(0);
16
  if (dfs(0, rooms, visited)) return true;
17
  return false;
18
};