cleaned up old work

Author: JoeKarlsson

breadthFirstSearch.js

@@ -3,36 +3,7 @@
 const Node = require('./graphGenerator');
 
 const BFS = (start) => {
-  // initailize the open to be the nodes we are currently exploring
-  let open = [];
-  open.push(start);
 
-  // Keep track of the nodes we have already visited, so we don't repeat nodes
-  let visited_nodes = [start];
-  let searched_path = [];
-
-  // Keep checking nodes until our open array is empty
-  while (open.length > 0) {
-
-    // Pull the first item off of our queue
-    let current = open.shift();
-
-    // Add the current node to our search path stack
-    searched_path.push(current);
-
-    //Iterate through all of the neighbors of the current node
-    current.neighbors.forEach((next) => {
-
-      // If we haven't already visisted a node, add it to our visisted stack, and add it to our open queue
-      if (visited_nodes.indexOf(next) < 0) {
-        visited_nodes.push(next);
-        open.push(next);
-      }
-    });
-  }
-
-  //Once we have traversed the whole graph - return the search path
-  return searched_path;
 }
 
 module.exports = BFS;

depthFirstSearch.js

@@ -2,41 +2,8 @@
 
 const Node = require('./graphGenerator');
 
-/*
-  1  procedure DFS(G,v):
-  2      label v as discovered
-  3      for all edges from v to w in G.adjacentEdges(v) do
-  4          if vertex w is not labeled as discovered then
-  5              recursively call DFS(G,w)
- */
 const DFS = (start, searchFor) => {
-  if (!searchFor || !start) {
-    throw new Error('Invalid input');
-  }
 
-  //If the node we are searching for
-  if (searchFor === start.value) {
-    return start;
-  }
-  let i;
-  let child;
-  let found;
-  let children = start.neighbors;
-
-  // iterate through all of the starting nodes children
-  for (i = 0; i < children.length; i++) {
-    child = children[i];
-
-    //Recursviely call the child nodes until we find
-    found = DFS(child, searchFor);
-
-    // If we find the item we are searching for - return the node
-    if(found){
-      return found;
-    }
-  }
-  // If we cannot find the node - return false;
-  return false;
 }
 
 module.exports = DFS;

graphGenerator.js

@@ -1,22 +1,8 @@
 // Implement a graph generator that represents a set of objects where some pairs of objects are connected by links.
 
 const Node = function(name, value) {
-  this.name = name;
-  this.value = value;
-  this.neighbors = [];
-}
-
-Node.prototype.addNeighbors = function(neighbors) {
-  this.neighbors = this.neighbors.concat(neighbors);
-  return this.neighbors;
-}
 
-Node.prototype.neighbors = function() {
-  return this.neighbors;
 }
 
-Node.prototype.toString = function() {
-  return this.name;
-}
 
 module.exports = Node;