Coursera-Algorithms
Coursera-Algorithms copied to clipboard
Help with understanding
I'm having a little problem undestanding your code. In the Percolation.java file, why do you use two WeightedQuickUnionUF ? I guess that when you use the method isfull(), the UnionFind instance will not be messed up. Am i right ?