Time: 524 ms (80.35%), Space: 152.6 MB (71.43%) - LeetHub

Author: chappdev2019

2121-find-if-path-exists-in-graph/2121-find-if-path-exists-in-graph.js

@@ -1,33 +1,31 @@
-
 /**
  * @param {number} n
  * @param {number[][]} edges
  * @param {number} source
  * @param {number} destination
  * @return {boolean}
  */
-var validPath = function(n, edges, source, destination) {
+var validPath = function (n, edges, source, destination) {
 
-    if (edges.length == 0) return true;
-    let map = new Map();
+    if (!edges.length) return true;
+    const map = new Map();
     for (let i = 0; i < edges.length; i++) {
-        let [node, next] = edges[i];
-        if (!map.has(node)) map.set(node, []);
-        if (!map.has(next)) map.set(next, []);
-        map.get(node).push(next);
-        map.get(next).push(node);
+        const [start, end] = edges[i];
+        if (!map.has(start)) map.set(start, []);
+        if (!map.has(end)) map.set(end, []);
+        map.get(start).push(end);
+        map.get(end).push(start);
     }
-    let queue = [];
+    let queue = [...map.get(source)]; 
     let visited = new Set();
-    queue.push(source);
-    while(queue.length > 0) {
+
+    while (queue.length > 0) {
         let cur = queue.pop();
-        for (const element of map.get(cur)) {
-            if (element === destination) return true;
-            if (!visited.has(element)) {
-                visited.add(element);
-                queue.push(element);
-            }
+        if (cur == destination) return true;
+        if (!visited.has(cur)) {
+            visited.add(cur);
+            let list = map.get(cur);
+            queue.push(...list) 
         }
     }
     return false;