docs

Author: amejiarosario

src/data-structures/graphs/graph.js

@@ -2,6 +2,7 @@
 const Node = require('./node');
 const Stack = require('../stacks/stack');
 const Queue = require('../queues/queue');
+const HashMap = require('../hash-maps/hash-map');
 
 /**
  * Graph that uses an adjacent list
@@ -29,6 +30,7 @@ class Graph {
    * @param {Symbol} edgeDirection either `Graph.DIRECTED` or `Graph.UNDIRECTED`
    */
   constructor(edgeDirection = Graph.DIRECTED) {
+    // this.nodes = new HashMap();
     this.nodes = new Map();
     this.edgeDirection = edgeDirection;
   }

src/data-structures/graphs/node.js

@@ -1,5 +1,5 @@
 /**
- * Graph node/vertex that hold adjacencies
+ * Graph node/vertex that hold adjacencies nodes
  */
 class Node {
   constructor(value) {

src/data-structures/hash-maps/hash-map.js

@@ -168,6 +168,27 @@ class HashMap {
       return acc;
     }, []);
   }
+
+  /**
+   * The values() method returns a new Iterator object that
+   * contains the values for each element in the Map object
+   * in insertion order.
+   *
+   * @example
+   *   const myMap = new HashMap();
+   *   myMap.set('0', 'foo');
+   *   myMap.set(1, 'bar');
+   *   myMap.set({}, 'baz');
+   *
+   *   var mapIter = myMap.values();
+   *
+   *   console.log(mapIter.next().value); // "foo"
+   *   console.log(mapIter.next().value); // "bar"
+   *   console.log(mapIter.next().value); // "baz"
+   */
+  values() {
+    throw new Error('Not implemented');
+  }
 }
 
 module.exports = HashMap;

src/data-structures/trees/tree-node-1.js

@@ -0,0 +1,12 @@
+/**
+ * Binary Tree Node
+ */
+class TreeNode {
+  constructor(value) {
+    this.value = value;
+    this.left = null;
+    this.right = null;
+  }
+}
+
+module.exports = TreeNode;