Depth first search

input will be a graph
{
  v : ['A', 'B', 'C', 'D', E', 'F'],
  e: {
    'A': ['B'],
    'B': ['A', 'C', 'D'],
    'C': ['B', 'D'],
    'D': ['B', 'C'],
    'E': ['F'],
    'F': ['E']
  }
}



function DFS(g) {
  let v = g.v;
  let e = g.e;
  
  let visited = {};
  for (let i = 0; i < v.length; i++) {
    if (!visited[v[i]]) {
      visit(v[i]);
    }
  }
}

function visit(vertex) {
  visited[vertex] = true;
  console.log(vertex);
  let edges = e[vertex];
  for (let i = 0; i < edges.length; i++) {
    if (!visited[edges[i]]) {
      visit(edges[i])
    }
  }
}