private void exploreStates(List<DFSAState<T, S>> toVisit, Set<DFSAState<T, S>> visited) { while (!toVisit.isEmpty()) { DFSAState<T, S> state = toVisit.get(toVisit.size() - 1); toVisit.remove(toVisit.size() - 1); if (!visited.contains(state)) { toVisit.addAll(state.successorStates()); visited.add(state); } } }
private static <T, S> void exploreStates(List<DFSAState<T, S>> toVisit, Set<DFSAState<T, S>> visited) { while (!toVisit.isEmpty()) { DFSAState<T, S> state = toVisit.get(toVisit.size() - 1); toVisit.remove(toVisit.size() - 1); if (!visited.contains(state)) { toVisit.addAll(state.successorStates()); visited.add(state); } } }
private void exploreStates(List<DFSAState<T, S>> toVisit, Set<DFSAState<T, S>> visited) { while (!toVisit.isEmpty()) { DFSAState<T, S> state = toVisit.get(toVisit.size() - 1); toVisit.remove(toVisit.size() - 1); if (!visited.contains(state)) { toVisit.addAll(state.successorStates()); visited.add(state); } } }
private void exploreStates(List<DFSAState<T, S>> toVisit, Set<DFSAState<T, S>> visited) { while (!toVisit.isEmpty()) { DFSAState<T, S> state = toVisit.get(toVisit.size() - 1); toVisit.remove(toVisit.size() - 1); if (!visited.contains(state)) { toVisit.addAll(state.successorStates()); visited.add(state); } } }
private static <T, S> void exploreStates(List<DFSAState<T, S>> toVisit, Set<DFSAState<T, S>> visited) { while (!toVisit.isEmpty()) { DFSAState<T, S> state = toVisit.get(toVisit.size() - 1); toVisit.remove(toVisit.size() - 1); if (!visited.contains(state)) { toVisit.addAll(state.successorStates()); visited.add(state); } } }
private static <T, S> void exploreStates(List<DFSAState<T, S>> toVisit, Set<DFSAState<T, S>> visited) { while (!toVisit.isEmpty()) { DFSAState<T, S> state = toVisit.get(toVisit.size() - 1); toVisit.remove(toVisit.size() - 1); if (!visited.contains(state)) { toVisit.addAll(state.successorStates()); visited.add(state); } } }
private static <T, S> void exploreStates(List<DFSAState<T, S>> toVisit, Set<DFSAState<T, S>> visited) { while (!toVisit.isEmpty()) { DFSAState<T, S> state = toVisit.get(toVisit.size() - 1); toVisit.remove(toVisit.size() - 1); if (!visited.contains(state)) { toVisit.addAll(state.successorStates()); visited.add(state); } } }
private void exploreStates(List<DFSAState<T, S>> toVisit, Set<DFSAState<T, S>> visited) { while (!toVisit.isEmpty()) { DFSAState<T, S> state = toVisit.get(toVisit.size() - 1); toVisit.remove(toVisit.size() - 1); if (!visited.contains(state)) { toVisit.addAll(state.successorStates()); visited.add(state); } } }