move class to be static

Author: amejiarosario

lib/data-structures/graphs/graph.js

@@ -128,25 +128,25 @@ class Graph {
    * Use a stack to visit nodes (LIFO)
    * @param {Node} first node to start the dfs
    */
-  * dfs(first) {
-    yield* this.graphSearch(first, Stack);
+  static* dfs(first) {
+    yield* Graph.graphSearch(first, Stack);
   }
 
   /**
    * Depth-first search
    * Use a queue to visit nodes (FIFO)
    * @param {Node} first node to start the dfs
    */
-  * bfs(first) {
-    yield* this.graphSearch(first, Queue);
+  static* bfs(first) {
+    yield* Graph.graphSearch(first, Queue);
   }
 
   /**
    * Generic graph search where we can pass a Stack or Queue
    * @param {Node} first node to start the search
    * @param {Stack|Queue} dsType Stack for DFS or Queue for BFS
    */
-  * graphSearch(first, dsType = Stack) {
+  static* graphSearch(first, dsType = Stack) {
     const visited = new Map();
     const visitList = new dsType();
 
@@ -172,7 +172,7 @@ class Graph {
     const destinationNode = this.nodes.get(destination);
 
     if (sourceNode && destinationNode) {
-      const bfsFromFirst = this.bfs(sourceNode);
+      const bfsFromFirst = Graph.bfs(sourceNode);
       for (const node of bfsFromFirst) {
         if (node === destinationNode) {
           return true;

lib/data-structures/graphs/graph.spec.js

@@ -164,15 +164,15 @@ describe('Graph', () => {
     describe('#dfs', () => {
 
       it('should visit nodes using depth-first search', () => {
-        const visitedOrder = Array.from(graph.dfs(first)).map(getValue);
+        const visitedOrder = Array.from(Graph.dfs(first)).map(getValue);
         expect(visitedOrder).toEqual([0, 1, 3, 2, 4, 5]);
       });
     });
 
     describe('#bfs', () => {
 
       it('should visit nodes using breadth-first search', () => {
-        const visitedOrder = Array.from(graph.bfs(first)).map(getValue);
+        const visitedOrder = Array.from(Graph.bfs(first)).map(getValue);
         expect(visitedOrder).toEqual([0, 5, 4, 1, 3, 2]);
       });
     });
@@ -198,12 +198,12 @@ describe('Graph', () => {
     describe('#dfs', () => {
 
       it('should visit nodes using depth-first search', () => {
-        const visitedOrder = Array.from(graph.dfs(first)).map(getValue);
+        const visitedOrder = Array.from(Graph.dfs(first)).map(getValue);
         expect(visitedOrder).toEqual([1, 4, 8, 3, 7, 6, 10, 2, 5, 9]);
       });
 
       it('should use iterator', () => {
-        const dfs = graph.dfs(first);
+        const dfs = Graph.dfs(first);
 
         expect(dfs.next().value.value).toBe(1);
         expect(dfs.next().value.value).toBe(4);
@@ -224,7 +224,7 @@ describe('Graph', () => {
     describe('#bfs', () => {
 
       it('should visit nodes using breadth-first search', () => {
-        const visitedOrder = Array.from(graph.bfs(first)).map(getValue);
+        const visitedOrder = Array.from(Graph.bfs(first)).map(getValue);
         expect(visitedOrder).toEqual([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);
       });
     });