static void dfs(int node, ArrayList<ArrayList<Integer>> g, boolean[] visited){
		if(visited[node]) return;
		System.out.printf("StartTime for Node: %d -- %d\n", node, timer++);
		visited[node]=true;
		for(int neighbor: g.get(node)){
			dfs(neighbor, g, visited);
		}
		System.out.printf("FinishTime for Node: %d -- %d\n", node, timer++);
	}