Percolation-threshold-via-Monte-Carlo-simulation. The percolation threshold is a mathematical concept in percolation theory that describes the formation of long-range connectivity in random systems. Below the threshold a giant connected component does not exist; while above it, there exists a giant component of the order of system size. In engineering and coffee making, percolation represents the flow of fluids through porous media, but in the mathematics and physics worlds it generally refers to simplified lattice models of random systems or networks (graphs), and the nature of the connectivity in them. The percolation threshold is the critical value of the occupation probability p, or more generally a critical surface for a group of parameters p1, p2, ..., such that infinite connectivity (percolation) first occurs. For More info: https://en.wikipedia.org/wiki/Percolation_threshold This imported libraries are part of algs4.jar, which accompanies the textbook

•  Algorithms, 4th edition by Robert Sedgewick and Kevin Wayne,
  

•  Addison-Wesley Professional, 2011, ISBN 0-321-57351-X.
  

•  http://algs4.cs.princeton.edu