perform a deep first search on a graph

++
void DFS(int curr, vector<int> adj[], bool vis[]){
  vis[curr] = true;
  for(auto i: adj[curr]) if(!vis[i]) DFS(i, adj, vis);
}