private static void dfs(int node){
		if(visited[node] == true) return;
		visited[node] = true;
			for(Integer neighbor:g.get(node)){
				if(visited[neighbor] == false)
					dfs(neighbor);
			}
		s.push(node);
	}