Class Node

graphs/depth-first-search.js:1–21

class Node {
  constructor(name) {
    this.name = name;
    this.children = [];
  }

  addChild(name) {
    this.children.push(new Node(name));
    return this;
  }

  // time O(v + e) where v are the vertices and e the edges of the graph
  // space O(v) because we are using recursion we could have v elements in the call stack
  depthFirstSearch(array) {
    array.push(this.name);
    for (const child of this.children) {
      child.depthFirstSearch(array);
    }
    return array;
  }
}

const graph = new Node("A");
graph.addChild("B").addChild("C").addChild("D");