public List<Vertex<T>> traversePath(DirectedGraph<T> graph, Vertex<T> start, Vertex<T> end) { TerminatingVisitor<T> visitor = new TerminatingVisitor<>(end); List<Vertex<T>> path = traverse(graph, start, visitor); if (visitor.wasFound()) { return path; } return Collections.emptyList(); }
public List<Vertex<T>> traversePath(DirectedGraph<T> graph, Vertex<T> start, Vertex<T> end) { TerminatingVisitor<T> visitor = new TerminatingVisitor<>(end); List<Vertex<T>> path = traverse(graph, start, visitor); if (visitor.wasFound()) { return path; } return Collections.emptyList(); }
public List<Vertex<T>> traversePath(DirectedGraph<T> graph, Vertex<T> start, Vertex<T> end) { TerminatingVisitor<T> visitor = new TerminatingVisitor<T>(end); List<Vertex<T>> path = traverse(graph, start, visitor); if (visitor.wasFound()) { return path; } return Collections.emptyList(); }