dfs-adj.js

var nodeNotVisited = (list,item) => {
	if (list.indexOf(item) === -1) {
		return true;
	}
	return false;
};


               A
            /	  \
	   F       B
	   /       / \
	  G       D    C
	/ | \     |
       J  I  H	  E

var graph = {
  "A": ["F","B"],
  "B": ["D","C"],
  "C": [],
  "D": ["E"],
  "E": [],
  "F": ["G"],
  "G": ["J","I","H"],
  "H": [],
  "I": [],
  "J": []
};

var dfs = (graph,node) => {
  let visited   = [];
	let stack     = [];
	stack.push(node);

	while (stack.length > 0) {
    let node = stack.pop();
    let neighbors = graph[node];
    visited.push(node);
	  if(neighbors.length > 0){
	    neighbors.forEach((neighbor) => {
	      stack.push(neighbor);
	    });
	  }
   }
   return visited;
};

dfs(graph,"A");