graphTraversalDFS.js

// visiting/updating/checking each vertex in a graph recursive
  depthFirstRecursive(start){
     const result = []
     const visited = {}
     const adjacencyList = this.adjacencyList
     
     (function dfs(vertex){
        if(!vertex) return null
        visited[vertex] = true
        result.push(vertex)
        adjacencyList[verte].forEach((neighbor) => {
           if(!visited[neighbor]){
               return dfs(neighbor)
           }
        })
     })(start)
     
     return result

   }

  dfsIterative(start){
  
  
  
  }