updated README to include what the addNieghbors function should return.

Author: JoeKarlsson

README.md

@@ -49,7 +49,7 @@ Is represented in memory as:
 The basic operations provided by a graph data structure usually include:
 
 1. Define a `Node` class that has a `name {{string}}`, `value{{*}}`, and `neighbors{{array}}`
-1. `Node.addNeighbors([x {{node}}, y {{node}}, z {{node}} ...])`: adds an array of nodes x, y, z to `node`.
+1. `Node.addNeighbors([x {{node}}, y {{node}}, z {{node}} ...])`: adds an array of nodes x, y, z to `node`. Return an array with all of the nodes neighbors.
 1. `Node.neighbors(x {{node}})`: lists all vertices such that there is an edge from the vertices x to y.
 1. `Node.toString()`: returns the name of the node as a String.
 1. [Optional] `Node.removeNode(x {{node}})`: removes the vertex x, if it is there.

graphGenerator.js

@@ -1,8 +1,6 @@
-// Implement a graph generator that represents a set of objects where some pairs of objects are connected by links.
-
 const Node = function(name, value) {
 
 }
 
 
-module.exports = Node;
+module.exports = Node;

test/graph-traversal.spec.js

@@ -13,9 +13,6 @@ describe('Graph Generator', () => {
     D = new Node("D", "JSON");
     E = new Node("E", "Marifel");
     F = new Node("F", "Nigel");
-    A.addNeighbors([B, C]);
-    B.addNeighbors([D, E]);
-    C.addNeighbors([F]);
   });
 
   it('should be a function that exists', () => {
@@ -56,6 +53,9 @@ describe('Graph Generator', () => {
     expect(C.addNeighbors()).to.exist;
   });
   it('Node `neighbors` should refernce other neighbors', () => {
+    A.addNeighbors([B, C]);
+    B.addNeighbors([D, E]);
+    C.addNeighbors([F]);
     expect(A.neighbors[0].name).to.equal('B');
     expect(A.neighbors[0].value).to.equal('Jon');
     expect(A.neighbors[0].neighbors[0].name).to.equal('D');