chore: updated code

Author: rupeshtiwari

README.md

@@ -319,7 +319,7 @@ The DFS algorithm we start from starting point and go into depth of graph until
 - **Strategy**: `Recursive`
 - **Time Complexity**: `O(n logn)`
 - **Space Complexity**: `O(n logn)`
-- Use `Stack` while coding.
+- Use `Recursive Call Stack` while coding.
 
 ![](https://i.imgur.com/DdFyXGx.png)
 
@@ -411,8 +411,14 @@ Find all possible routes from `PHX` to `BKK`. Also then you can decide which pat
 
 ![](https://i.imgur.com/CvPhRQx.png)
 
+![]((https://i.imgur.com/DrWF78t.png)
+
 #### Depth First Search (DFS)
 
+![](https://i.imgur.com/wHevaTK.png)
+
+[Exercise Answer Source Code: Find shortest path using DFS](./src/data-structure/5-graph/depth-first-search.mjs)
+
 ## Algorithms Q&A
 
 ### Merge Sort

src/data-structure/5-graph/breadth-first-search.mjs

@@ -1,11 +1,14 @@
 /**
  * Search all possible routes from PHX and BKK
+* RunTime complexity O(V+E) V= Node, E = edges
+ * Space complexity O(n) = linear
+ * It takes 8 steps to find the destination
  * @param start node
  */
 
 import { createGraph } from './implement-graph.mjs';
 
-function bfs(graph, start, end) {
+function bfs(graph, start, toFind) {
   const queue = [];
   queue.push(start);
   const visited = new Set();
@@ -18,8 +21,8 @@ function bfs(graph, start, end) {
     if (!destinations) continue;
 
     for (const destination of destinations) {
-      if (end === destination) {
-        console.log(`====We found Bangkok====`);
+      if (toFind === destination) {
+          console.log('!! We found !!', toFind, 'in', visited.size, ' steps');
       }
 
       if (!visited.has(destination)) {
@@ -34,6 +37,9 @@ function bfs(graph, start, end) {
 const graph = createGraph();
 bfs(graph, 'PHX', 'BKK');
 
+
+ 
+bfs(graph, 'LIM', 'BKK');
 /**
  * PHX => [ ABC, XYZ ]
  * ABC => [ BBB, CCC ]

src/data-structure/5-graph/depth-first-search.mjs

@@ -0,0 +1,27 @@
+import { createGraph } from './implement-graph.mjs';
+
+/**
+ * RunTime complexity O(V+E) V= Node, E = edges
+ * Space complexity O(n) = linear
+ * It takes 3 steps or functions calls to find the destination
+ * @param graph
+ * @param start
+ * @param toFind
+ */
+function dfs(graph, start, toFind, visited = new Set()) {
+  console.log(start);
+  const destinations = graph.getEdges(start);
+  visited.add(start);
+
+  for (const destination of destinations) {
+    if (destination === toFind) {
+      console.log('!! We found !!', toFind, 'in', visited.size, ' steps');
+      return;
+    }
+    if (!visited.has(destination)) {
+      dfs(graph, destination, toFind, visited);
+    }
+  }
+}
+const graph = createGraph();
+dfs(graph, 'PHX', 'BKK');

src/data-structure/5-graph/implement-graph.mjs

@@ -16,6 +16,10 @@ export class Graph {
       ? this.nodes.get(destination).push(origin)
       : this.nodes.set(destination, [origin]);
   }
+
+  getEdges(origin) {
+    return this.nodes.get(origin);
+  }
 }
 
 export const routes = [