Merge pull request #16 from devvsakib/devvsakib

working process, test cases added

Author: devvsakib

L-A/0001 MemoizedNthNumberFibonacci ( L-A )/0002 BFSTraverseGraph/BFS_traversegraph.js

@@ -0,0 +1,22 @@
+class Node {
+  constructor(value, neighbors = []) {
+    this.value = value;
+    this.neighbors = neighbors;
+  }
+}
+
+function bfs(start, target) {
+  const queue = [start];
+  const visited = new Set();
+
+  while (queue.length) {
+    const node = queue.shift();
+    if (node.value === target) return true;
+    if (visited.has(node)) continue;
+    visited.add(node);
+
+    queue.push(...node.neighbors);
+  }
+
+  return false;
+}

L-A/0002 BFSTraverseGraph/BFS_traversegraph.js

@@ -1,8 +1,23 @@
+# 0002 BFSTraverseGraph ( L-A )
+
 ## Problem
 
 Implement a JavaScript function that implements a breadth-first search (BFS) algorithm to traverse a graph.
 
 
+## Test Cases
+const a = new Node('a');
+const b = new Node('b');
+const c = new Node('c');
+const d = new Node('d');
+const e = new Node('e');
+const f = new Node('f');
+
+- a.neighbors = [b, c, e]; console.log(bfs(a, 'f')); // false
+- b.neighbors = [d, e]; console.log(bfs(b, 'd')); // true
+- c.neighbors = [f]; console.log(bfs(c, 'f')); // true
+
+
 ## Solution
 
 ```javascript
@@ -29,9 +44,11 @@ class Node {
     return false;
   }
   ```
-  
-  ## How it works
 
+## How it works
+
+-  We create a class called Node that takes a value and an array of neighbors as parameters.
+-  We create a function called bfs that takes a start node and a target node as parameters.
 -  We create a queue and add the start node to it.
 -  We create a visited set to keep track of the nodes we have visited.
 -  We loop through the queue while it is not empty.
@@ -59,4 +76,4 @@ class Node {
 ## Contributing
 Pull requests are welcome. For major changes, please open an issue first to discuss what you would like to change.
 
-Please make sure to update tests as appropriate.
+Please make sure to update tests as appropriate.