diff options
author | Haidong Ji | 2020-05-10 16:18:46 -0500 |
---|---|---|
committer | Haidong Ji | 2020-05-10 16:18:46 -0500 |
commit | bc5a6815181068e76316aa4a611647124d18ba48 (patch) | |
tree | aab5f2386523dfb064a51a689310a183f8286016 /src/main |
Reachability done. I found it much easier to work with Java than Python. I tried to start with Python but found it difficult to get started.
Diffstat (limited to 'src/main')
-rw-r--r-- | src/main/Reachability.java | 47 |
1 files changed, 47 insertions, 0 deletions
diff --git a/src/main/Reachability.java b/src/main/Reachability.java new file mode 100644 index 0000000..8d6ab78 --- /dev/null +++ b/src/main/Reachability.java @@ -0,0 +1,47 @@ +import java.util.ArrayList; +import java.util.Scanner; + +public class Reachability { + + static int reach(ArrayList<ArrayList<Integer>> adj, int x, int y) { + ArrayList<Integer> visited = new ArrayList<>(); + if (x == y) + return 1; + explore(adj, visited, x, y); + if (visited.contains(y)) + return 1; + return 0; + } + + private static void explore(ArrayList<ArrayList<Integer>> adj, ArrayList<Integer> visited, int x, int y) { + visited.add(x); + if (x == y) + return; + for (int n : adj.get(x)) { + if (!visited.contains(n)) + explore(adj, visited, n, y); + } + } + + + public static void main(String[] args) { + Scanner scanner = new Scanner(System.in); + int n = scanner.nextInt(); + int m = scanner.nextInt(); + ArrayList<ArrayList<Integer>> adj = new ArrayList<ArrayList<Integer>>(); + for (int i = 0; i < n; i++) { + adj.add(new ArrayList<Integer>()); + } + for (int i = 0; i < m; i++) { + int x, y; + x = scanner.nextInt(); + y = scanner.nextInt(); + adj.get(x - 1).add(y - 1); + adj.get(y - 1).add(x - 1); + } + int x = scanner.nextInt() - 1; + int y = scanner.nextInt() - 1; + System.out.println(reach(adj, x, y)); + } +} + |