CSC300 / CSC402: Homework (UF problems, Percolation)

Contents [0/1]

Homework (UF Problems, Percolation) [1/1]

(Click here for one slide per page)


Homework (UF Problems, Percolation) [1/1]

file:Percolation.java [source]
01
02
03
04
05
06
07
08
09
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
package algs15.perc;

//import stdlib.*;
//import algs15.*;

// Uncomment the import statements above.

// You can test this using InteractivePercolationVisualizer and PercolationVisualizer
// All methods should make at most a constant number of calls to a UF data structure.
// You can use more than one UF data structure.
// You can assume that N>1
//
// Note that you can print out a UF structure using its toString method.
// You can also use the toGraphviz method to draw the UF.
// These may be useful for debugging.
// Try calling them whenever you open a new square.
public class Percolation {
  int N;
  boolean[] open;
  // TODO: more fields to add here
  public Percolation(int N) {
    if (N < 2) throw new IllegalArgumentException();
    this.N = N;
    this.open = new boolean[N*N];
    // TODO: more to do here
  }
  // open site (row i, column j) if it is not already
  public void open(int i, int j) {
    int x = i*N+j;
    if (!open[x]) {
      open[x] = true;
      // TODO: more to do here.
    }
  }
  // is site (row i, column j) open?
  public boolean isOpen(int i, int j) {
    return open[i*N+j];
  }
  // is site (row i, column j) full?
  public boolean isFull(int i, int j) {
    // TODO
    return false;
  }
  // does the system percolate?
  public boolean percolates() {
    // TODO
    return false;
  }
}