test: increases DirectedGraph coverage to 100%

Author: thawkin3

src/data-structures/directed-graph/src/directed-graph.js

@@ -61,7 +61,7 @@ export class DirectedGraph {
     console.log(printedMessage)
   }
 
-  breadthFirstSearch(startingNode, searchingForNode, callback) {
+  breadthFirstSearch(startingNode, searchingForNode, callback, showLogs) {
     const visitedNodes = {}
     const nodesToVisitQueue = []
 
@@ -79,20 +79,20 @@ export class DirectedGraph {
         }
 
         const currentNodeNeighbors = this.nodes.get(currentNode)
-        console.log(
-          'currentNode:',
-          currentNode,
-          'currentNodeNeighbors:',
-          currentNodeNeighbors.join(', ')
-        )
+
+        /* istanbul ignore next */
+        showLogs &&
+          console.log(
+            'currentNode:',
+            currentNode,
+            'currentNodeNeighbors:',
+            currentNodeNeighbors.join(', ')
+          )
 
         currentNodeNeighbors.forEach(neighborNode => {
           nodesToVisitQueue.push(neighborNode)
         })
       }
     }
   }
-
-  // eslint-disable-next-line no-unused-vars
-  depthFirstSearch(startingNode, searchingForNode, callback) {}
 }

src/data-structures/directed-graph/src/directed-graph.test.js

@@ -86,6 +86,30 @@ describe('DirectedGraph', () => {
         'Node does not exist in the graph.'
       )
     })
+
+    it('returns an array of node neghbors for an existing node with some neighbors', () => {
+      const graph = new DirectedGraph()
+      graph.addNode('A')
+      graph.addNode('B')
+      graph.addNode('C')
+
+      graph.addEdge('A', 'B')
+      graph.addEdge('A', 'C')
+
+      expect(graph.getNodeNeighbors('A')).toEqual(['B', 'C'])
+    })
+
+    it('returns an empty array of node neghbors for an existing node that does not have any neighbors', () => {
+      const graph = new DirectedGraph()
+      graph.addNode('A')
+      graph.addNode('B')
+      graph.addNode('C')
+
+      graph.addEdge('A', 'B')
+      graph.addEdge('A', 'C')
+
+      expect(graph.getNodeNeighbors('C')).toEqual([])
+    })
   })
 
   describe('printGraph', () => {