From 2dd66619bbd1bf45e092c54f70d89d8f27d269dc Mon Sep 17 00:00:00 2001 From: Haidong Ji Date: Sat, 16 May 2020 21:22:14 -0500 Subject: ConnectedComponents (Adding Exits to Maze) done. I didn't build my test cases properly initially: when v and w are connected, they should be in each other's ArrayList. Once that's fixed, it was easy. --- src/main/ConnectedComponents.java | 44 +++++++++++++++++++++++++++++++++++++++ 1 file changed, 44 insertions(+) create mode 100644 src/main/ConnectedComponents.java (limited to 'src/main') diff --git a/src/main/ConnectedComponents.java b/src/main/ConnectedComponents.java new file mode 100644 index 0000000..915509c --- /dev/null +++ b/src/main/ConnectedComponents.java @@ -0,0 +1,44 @@ +import java.util.ArrayList; +import java.util.Scanner; + +public class ConnectedComponents { + + static int numberOfComponents(ArrayList> adj) { + ArrayList visited = new ArrayList<>(); + int cc = 0; + for (int v = 0; v < adj.size(); v++) { + if (!visited.contains(v)) { + explore(adj, visited, v); + cc++; + } + } + return cc; + } + + private static void explore(ArrayList> adj, ArrayList visited, int v) { + visited.add(v); + + for (int n : adj.get(v)) { + if (!visited.contains(n)) + explore(adj, visited, n); + } + } + + public static void main(String[] args) { + Scanner scanner = new Scanner(System.in); + int n = scanner.nextInt(); + int m = scanner.nextInt(); + ArrayList> adj = new ArrayList>(); + for (int i = 0; i < n; i++) { + adj.add(new ArrayList()); + } + 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); + } + System.out.println(numberOfComponents(adj)); + } +} -- cgit v1.2.3