fixed graph.js

Author: amejiarosario

lib/data-structures/graphs/graph.js

@@ -1,3 +1,4 @@
+// npx eslint --fix -f codeframe lib/data-structures/graphs/graph.js
 const Node = require('./node');
 const Stack = require('../stacks/stack');
 const Queue = require('../queues/queue');
@@ -173,6 +174,7 @@ class Graph {
 
     if (sourceNode && destinationNode) {
       const bfsFromFirst = Graph.bfs(sourceNode);
+      // eslint-disable-next-line no-restricted-syntax
       for (const node of bfsFromFirst) {
         if (node === destinationNode) {
           return true;

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

@@ -61,7 +61,7 @@ describe('Graph', () => {
       const [first, second] = graph.addEdge(0, false);
       expect(first.value).toBe(0);
       expect(second.value).toBe(false);
-    })
+    });
   });
 
   describe('#removeEdge', () => {
@@ -126,7 +126,9 @@ describe('Graph', () => {
   });
 
   describe('remove vertex and update adjacency list', () => {
-    let n1, n2, n4;
+    let n1,
+      n2,
+      n4;
 
     beforeEach(() => {
       // 0 -> 1 <- 2
@@ -163,15 +165,13 @@ describe('Graph', () => {
     });
 
     describe('#dfs', () => {
-
       it('should visit nodes using depth-first search', () => {
         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);
         expect(visitedOrder).toEqual([0, 5, 4, 1, 3, 2]);
@@ -197,7 +197,6 @@ describe('Graph', () => {
     });
 
     describe('#dfs', () => {
-
       it('should visit nodes using depth-first search', () => {
         const visitedOrder = Array.from(Graph.dfs(first)).map(getValue);
         expect(visitedOrder).toEqual([1, 4, 8, 3, 7, 6, 10, 2, 5, 9]);
@@ -223,7 +222,6 @@ describe('Graph', () => {
     });
 
     describe('#bfs', () => {
-
       it('should visit nodes using breadth-first search', () => {
         const visitedOrder = Array.from(Graph.bfs(first)).map(getValue);
         expect(visitedOrder).toEqual([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);
@@ -232,7 +230,9 @@ describe('Graph', () => {
   });
 
   describe('with (people) edges on undigraph', () => {
-    let you, mary, barbara;
+    let you,
+      mary,
+      barbara;
 
     beforeEach(() => {
       graph = new Graph(Graph.UNDIRECTED);
@@ -241,7 +241,6 @@ describe('Graph', () => {
     });
 
     describe('#areConnected', () => {
-
       it('should return true if two nodes are connected', () => {
         expect(graph.areConnected('You', 'Barbara')).toBe(true);
       });

lib/data-structures/graphs/node.js

@@ -27,7 +27,7 @@ class Node {
    */
   removeAdjacent(node) {
     const index = this.adjacents.indexOf(node);
-    if(index > -1) {
+    if (index > -1) {
       this.adjacents.splice(index, 1);
       return node;
     }
@@ -52,4 +52,4 @@ class Node {
   }
 }
 
-module.exports = Node;
+module.exports = Node;

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

@@ -15,7 +15,10 @@ describe('Node (Graph)', () => {
   });
 
   describe('#removeAdjacent', () => {
-    let a, b, c, d;
+    let a,
+      b,
+      c,
+      d;
 
     beforeEach(() => {
       a = node;
@@ -38,17 +41,17 @@ describe('Node (Graph)', () => {
     it('should return undefined if not found', () => {
       expect(a.removeAdjacent(d)).toBe(undefined);
       expect(node.adjacents.map(n => n.value)).toEqual(['b', 'c']);
-    })
+    });
   });
 
   describe('#getAdjacents', () => {
     it('should get adjacents', () => {
       node.addAdjacent(new Node('b'));
-      expect(node.getAdjacents().map(n => n.value)).toEqual(['b'])
+      expect(node.getAdjacents().map(n => n.value)).toEqual(['b']);
     });
 
     it('should get adjacents when empty', () => {
-      expect(node.getAdjacents().map(n => n.value)).toEqual([])
+      expect(node.getAdjacents().map(n => n.value)).toEqual([]);
     });
   });
 
@@ -64,4 +67,4 @@ describe('Node (Graph)', () => {
       expect(node.isAdjacent(c)).toBe(false);
     });
   });
-});
+});