code: function(element, iteratee, opt) {
  
          opt = opt || {};
          if (opt.breadthFirst) {
              this.bfs(element, iteratee, opt);
          } else {
              this.dfs(element, iteratee, opt);
          }
      }
docs: Perform search on the graph. If `opt.breadthFirst` is `true`, use the Breadth-first Search algorithm, otherwise use Depth-first search. By setting `opt.inbound` to `true`, you can reverse the direction of the search. If `opt.deep` is `true`, take into account embedded elements too. `iteratee` is a function of the form `function(element) {}`. If `iteratee` explicitely returns `false`, the searching stops.