import java.util.*;

public class GraphMethods<E> {

	static<E> void depthFirstSearch(Graph graph, E e, Set<E> visited){
		visited.add(e);
		Map<E, List<ListEdge<E>>> nodes = graph.getNodes();
		for(ListEdge<E> le : nodes.get(e)){
			if(!visited.contains(le.getDest())){
				depthFirstSearch(graph, le.getDest(), visited);
			}
		}
	}
	static<E> boolean pathExists(Graph graph, E from, E to){
		Set<E> visited = new HashSet<E>();
		depthFirstSearch(graph, from, visited);
		return visited.contains(to);
	}
}