First version practical 1 (garbage collection)

1 files changed, 57 insertions, 0 deletions

diff --git a/Practical1/src/nl/camilstaps/cs/GarbageCollectionHelper.java b/Practical1/src/nl/camilstaps/cs/GarbageCollectionHelper.java
new file mode 100644
index 0000000..8367ea2
--- /dev/null
+++ b/Practical1/src/nl/camilstaps/cs/GarbageCollectionHelper.java
@@ -0,0 +1,57 @@
+package nl.camilstaps.cs;
+
+import nl.camilstaps.cs.graphs.Graph;
+import nl.camilstaps.cs.graphs.Node;
+
+import java.util.Scanner;
+
+/**
+ * Solution for the Garbage Collection problem.
+ *
+ * @author Camil Staps
+ */
+class GarbageCollectionHelper {
+
+    /**
+     * Read in a Graph from stdin and print whether we can place N bins to stdout
+     * @param args
+     */
+    public static void main(String[] args) {
+        GarbageCollectionMap graph = new GarbageCollectionMap();
+        int n_bins = readGraph(new Scanner(System.in), graph);
+        System.out.println(graph.canPlaceNBins(n_bins) ? "possible" : "impossible");
+    }
+
+    /**
+     * Read a Graph in the defined format:
+     *
+     *      [n_edges] [n_nodes] [n_bins]
+     *      [fst] [snd]
+     *      [fst] [snd]
+     *      [fst] [snd]
+     *      ...
+     *
+     * @param sc the Scanner to use
+     * @param graph the Graph to build
+     * @return the number of bins
+     */
+    private static int readGraph(Scanner sc, Graph graph) {
+        int n_edges = sc.nextInt();
+        int n_nodes = sc.nextInt();
+        int n_bins  = sc.nextInt();
+
+        for (int i = 1; i <= n_nodes; i++) {
+            graph.addNode(new Node(i));
+        }
+
+        for (int i = 0; i < n_edges; i++) {
+            int fst = sc.nextInt();
+            int snd = sc.nextInt();
+            graph.getNode(fst - 1).getNeighbours().add(graph.getNode(snd - 1));
+            graph.getNode(snd - 1).getNeighbours().add(graph.getNode(fst - 1));
+        }
+
+        return n_bins;
+    }
+
+}