(int src, Map<Integer, List<Integer>> adj, Set<Integer> visit, Set<Integer> secrets)
| 25 | } |
| 26 | |
| 27 | private void dfs(int src, Map<Integer, List<Integer>> adj, Set<Integer> visit, Set<Integer> secrets) { |
| 28 | if (visit.contains(src)) { |
| 29 | return; |
| 30 | } |
| 31 | visit.add(src); |
| 32 | secrets.add(src); |
| 33 | for (Integer nei : adj.get(src)) { |
| 34 | dfs(nei, adj, visit, secrets); |
| 35 | } |
| 36 | } |
| 37 | |
| 38 | public static void main(String[] args) { |
| 39 | Solution solution = new Solution(); |
no test coverage detected