An implementation of algorithms for constructing and analyzing the cluster structure for a square quadruply connected lattice in the uncorrelated percolation problem is considered. Subsets of the complete superior hull and the skeleton of a percolation cluster are singled out using a modification of the Hoshen—Kopelman relabeling algorithm and the Bellman principle of optimality. The critical nature of the percolation process is demonstrated using the method for statistical tests, and the behavior of mass dimension is analyzed for various subsets of a percolation cluster.