Method Graph

Programs/DFS.java:14–23

(int v)

	private boolean visited[]; //to keep track of the node which are visited.
	
	Graph(int v){
		this.v = v;
		this.adj = new LinkedList[v];
		this.visited = new boolean[v];
		for(int i=0;i<this.v;i++) {
			adj[i] = new LinkedList<Integer>();
			this.visited[i] = false;
		}
	
	}
	
	
	public void addEdge(int u,int v) { // edge from u -> v