| 49 | |
| 50 | // Returns the set of all valid words in the given Boggle board, as an Iterable. |
| 51 | public Iterable<String> getAllValidWords(BoggleBoard board) { |
| 52 | HashSet<String> set = new HashSet<>(); |
| 53 | boolean[][] visited = new boolean[board.rows()][board.cols()]; |
| 54 | StringBuilder sb = new StringBuilder(); |
| 55 | |
| 56 | for (int i = 0; i < board.rows(); ++i) { |
| 57 | for (int j = 0; j < board.cols(); ++j) { |
| 58 | dfs(root, board, i, j, sb, visited, set); |
| 59 | } |
| 60 | } |
| 61 | |
| 62 | return set; |
| 63 | } |
| 64 | |
| 65 | private void dfs(Node x, BoggleBoard board, int i, int j, StringBuilder sb, boolean[][] visited, |
| 66 | HashSet<String> set) { |