visualizer

Author: vm137

src/Percolation.java

@@ -2,15 +2,25 @@
 import edu.princeton.cs.algs4.QuickFindUF;
 
 public class Percolation {
-    private int MaxN;
-    private int[][] Matrix;
+    private int MaxN, P, Q;
+    private QuickFindUF UFarray;
 
 
     public Percolation(int n) {
-        System.out.println("Percolation constructor " + n);
+        System.out.println("Percolation constructor (x" + n + ")");
         MaxN = n;
-        Matrix = new int[MaxN][MaxN];
+        P = MaxN * MaxN + 1;
+        Q = MaxN * MaxN + 2;
+        UFarray = new QuickFindUF(MaxN * MaxN + 2);
 
+        System.out.println(UFarray.count());
+        UFarray.union(5,6);
+        UFarray.union(5,7);
+        System.out.println(UFarray.count());
+
+        System.out.println(UFarray.find(5));
+        System.out.println(UFarray.connected(5,6));
+        System.out.println(UFarray.connected(5,8));
 
         int row, col, c = 0; // TODO: c - temp
 
@@ -26,15 +36,17 @@ public Percolation(int n) {
 
     }
 
-    public void open(int row, int col) { Matrix[row][col] = 1; }
-    public boolean isOpen(int row, int col) { return (boolean)(Matrix[row][col] >= 1); } // is site (row, col) open?
-    public boolean isFull(int row, int col) { return (boolean)(Matrix[row][col] == 2); } // is site (row, col) full?
+    public void open(int row, int col) {  }
+
+    public boolean isOpen(int row, int col) { return true; }
+
+    public boolean isFull(int row, int col) { return true; }
 
     public int numberOfOpenSites() {
         int count = 0;
         for (int row = 0; row < MaxN; row++) {
             for (int col = 0; col < MaxN; col++) {
-                if (Matrix[row][col] >= 1) count++;
+                // if (Matrix[row][col] >= 1) count++;
             }
         }
         return count;
@@ -51,7 +63,7 @@ public boolean percolates() {
     private void visualizeMatrix() {
         for (int row = 0; row < MaxN; row++) {
             for (int col = 0; col < MaxN; col++) {
-                System.out.print(Matrix[row][col]);
+                // System.out.print(Matrix[row][col]);
             }
             System.out.print("\n");
         }
@@ -63,7 +75,7 @@ public static void main(String[] args) {
         Percolation p = new Percolation(6);
         p.visualizeMatrix();
 
-        System.out.println("open sites: " + p.numberOfOpenSites());
+        // System.out.println("open sites: " + p.numberOfOpenSites());
     }
 
 }

src/PercolationVisualizer.java

@@ -0,0 +1,85 @@
+/******************************************************************************
+ *  Compilation:  javac PercolationVisualizer.java
+ *  Execution:    java PercolationVisualizer input.txt
+ *  Dependencies: Percolation.java
+ *
+ *  This program takes the name of a file as a command-line argument.
+ *  From that file, it
+ *
+ *    - Reads the grid size n of the percolation system.
+ *    - Creates an n-by-n grid of sites (intially all blocked)
+ *    - Reads in a sequence of sites (row i, column j) to open.
+ *
+ *  After each site is opened, it draws full sites in light blue,
+ *  open sites (that aren't full) in white, and blocked sites in black,
+ *  with with site (1, 1) in the upper left-hand corner.
+ *
+ ******************************************************************************/
+
+import java.awt.Font;
+
+import edu.princeton.cs.algs4.In;
+import edu.princeton.cs.algs4.StdDraw;
+
+public class PercolationVisualizer {
+
+    // delay in miliseconds (controls animation speed)
+    private static final int DELAY = 100;
+
+    // draw n-by-n percolation system
+    public static void draw(Percolation perc, int n) {
+        StdDraw.clear();
+        StdDraw.setPenColor(StdDraw.BLACK);
+        StdDraw.setXscale(-0.05*n, 1.05*n);
+        StdDraw.setYscale(-0.05*n, 1.05*n);   // leave a border to write text
+        StdDraw.filledSquare(n/2.0, n/2.0, n/2.0);
+
+        // draw n-by-n grid
+        int opened = 0;
+        for (int row = 1; row <= n; row++) {
+            for (int col = 1; col <= n; col++) {
+                if (perc.isFull(row, col)) {
+                    StdDraw.setPenColor(StdDraw.BOOK_LIGHT_BLUE);
+                    opened++;
+                }
+                else if (perc.isOpen(row, col)) {
+                    StdDraw.setPenColor(StdDraw.WHITE);
+                    opened++;
+                }
+                else
+                    StdDraw.setPenColor(StdDraw.BLACK);
+                StdDraw.filledSquare(col - 0.5, n - row + 0.5, 0.45);
+            }
+        }
+
+        // write status text
+        StdDraw.setFont(new Font("SansSerif", Font.PLAIN, 12));
+        StdDraw.setPenColor(StdDraw.BLACK);
+        StdDraw.text(0.25*n, -0.025*n, opened + " open sites");
+        if (perc.percolates()) StdDraw.text(0.75*n, -0.025*n, "percolates");
+        else                   StdDraw.text(0.75*n, -0.025*n, "does not percolate");
+
+    }
+
+    public static void main(String[] args) {
+        In in = new In(args[0]);      // input file
+        int n = in.readInt();         // n-by-n percolation system
+
+        // turn on animation mode
+        StdDraw.enableDoubleBuffering();
+
+        // repeatedly read in sites to open and draw resulting system
+        Percolation perc = new Percolation(n);
+        draw(perc, n);
+        StdDraw.show();
+        StdDraw.pause(DELAY);
+        while (!in.isEmpty()) {
+            int i = in.readInt();
+            int j = in.readInt();
+            perc.open(i, j);
+            draw(perc, n);
+            StdDraw.show();
+            StdDraw.pause(DELAY);
+        }
+    }
+}