Depth First Traversal, with Stack

DFS with Stack

vector<int> adjList[N];
int visited[N];

void dfsstack(int u)
{
    stack<int> nstack;//stack used in place of recursion stack
    visited[u] = 1;
    nstack.push(u);
    while(!nstack.empty())
    {
        int tp = nstack.top();
        nstack.pop();
        for(int i=0;i<adjList[tp].size();i++)
        {
            if(!visited[adjList[tp][i]])
            {
                nstack.push(adjList[tp][i]);
                visited[adjList[tp][i]] = 1;
                //visited that node, the time has come :)
            }
        }
    }
}