/** * Returns an iterator of all paths between two nodes, shortest first. * * <p>The current implementation is not optimal.</p> */ public List<List<V>> getPaths(V from, V to) { List<List<V>> list = new ArrayList<>(); findPaths(from, to, list); return list; }
/** * Returns an iterator of all paths between two nodes, shortest first. * * <p>The current implementation is not optimal.</p> */ public List<List<V>> getPaths(V from, V to) { List<List<V>> list = new ArrayList<>(); findPaths(from, to, list); return list; }