DFS followed Tam's style

ex2.cpp

#include <stack>
class Graph
{
private:
	int V;
	Adjacency *adj;

public:
	Graph(int V)
	{
		this->V = V;
		adj = new Adjacency[V];
	}
	
	void addEdge(int v, int w)
	{
		adj[v].push(w);
		adj[w].push(v);
	}
	
    void printGraph()
	{
		for (int v = 0; v < V; ++v)
		{
			cout << "\nAdjacency list of vertex " << v << "\nhead ";
			adj[v].print();
		}
	}
	
	Adjacency *DFS(int v)
    {
        Adjacency * res = new Adjacency(V);
        int * visited = new int[V];
        for (int i = 0; i < V; i++) {
            visited[i] = 0;
        }
        stack<int> s;
        s.push(v);
        
        while (s.size() != 0) {
            int u = s.top();
            if (visited[u] == 0) {
                res->push(u);
                visited[u] = 1;
            }
            s.pop();
            int n = adj[u].getSize();
            for (int i = n - 1; i >= 0; i--) {
                int v = adj[u].getElement(i);
                if (visited[v] == 0) {
                    s.push(v);
                }
            }
        }
        
        delete[] visited;
        
        return res;
	}
};