Maximal Network Rank LeetCode solution in JavaScript

1
var maximalNetworkRank = function (n, roads) {
2
  let res = 0;
3
  let map = new Map();
4
  roads.forEach(([u, v]) => {
5
    map.set(u, map.get(u) || new Set());
6
    let set = map.get(u);
7
    set.add(v);
8

9
    map.set(v, map.get(v) || new Set());
10
    set = map.get(v);
11
    set.add(u);
12
  });
13

14
  for (let i = 0; i < n; i++) {
15
    if (!map.has(i)) continue;
16
    let uAdj = map.get(i);
17
    let uCount = uAdj.size;
18
    for (let j = i + 1; j < n; j++) {
19
      if (!map.has(j)) continue;
20
      let vAdj = map.get(j);
21
      let vCount = vAdj.size;
22
      if (vAdj.has(i)) vCount--;
23
      res = Math.max(uCount + vCount, res);
24
    }
25
  }
26
  return res;
27
};