Added solution to ch4-1 and an empty spec file. Tests will be written later when I've had a chance to write some helpers to create and validate graph data.

Author: diadical

src/chapter4/ch4-q01.js

@@ -0,0 +1,40 @@
+'use strict';
+
+export function isConnectedBFS(graph, source, target) {
+  let discovered = new Set(),
+    queue = [source];
+
+  while (queue.length > 0) {
+    let node = queue.shift();
+    for (let neighbour of graph[node]) {
+      if (!discovered.has(neighbour)) {
+        if (neighbour === target) {
+          return true;
+        }
+        discovered.add(neighbour);
+        queue.push(neighbour);
+      }
+    }
+  }
+
+  return false;
+}
+
+function dfs(graph, discovered, source, target) {
+  if (source === target) {
+    return true;
+  }
+  discovered.add(source);
+  for (let neighbour of graph[source]) {
+    if (!discovered.has(neighbour)) {
+      if (dfs(graph, discovered, neighbour, target)) {
+        return true;
+      }
+    }
+  }
+  return false;
+}
+
+export function isConnectedDFS(graph, source, target) {
+  return dfs(graph, new Set(), source, target);
+}

src/chapter4/ch4-q01.spec.js

@@ -0,0 +1,12 @@
+//import { expect } from 'chai';
+//import * as helpers from './helpers';
+import * as funcs from './ch4-q01';
+
+for (let key in funcs) {
+//  let func = funcs[key];
+
+  describe('ch4-q01: ' + key, function() {
+    // TODO
+  });
+
+}