4.1 Routes between nodes - doesn't work with cyclic graphs

Author: amejiarosario

src/trees-and-graphs/graph.js

@@ -41,7 +41,7 @@ Graph.prototype.bfs = function* (node) {
 
   queue.add(node);
 
-  while(!queue.isEmpty()){
+  while(!queue.isEmpty()) {
     const current = queue.remove();
     yield current;
     const adjacents = this.nodes[current] || [];

src/trees-and-graphs/graph.spec.js

@@ -51,5 +51,15 @@ describe('Graph', function () {
       expect(bfs.next().done).to.equal(true);
       expect(bfs.next().value).to.equal(undefined);
     });
+
+    it('should recover from cyclic graphs', function () {
+      graph.add(3, 0);
+      const bfs = graph.bfs(1);
+      expect(bfs.next().value).to.eql(1);
+      expect(bfs.next().value).to.eql(3);
+      expect(bfs.next().value).to.eql(0);
+      expect(bfs.next().value).to.eql(2);
+      expect(bfs.next().done).to.equal(true);
+    });
   });
 });